Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Resource Binding"”.

  1. High-Level Resource Binding and Allocation for Power and Performance Optimization

    … of abstraction. In this thesis, we present two resource binding and allocation algorithms that take advantage of the optimization opportunities available at the higher level of abstraction. The first is a new variation-aware high-level synthesis binding and module selection algorithm, named …

    uiuc Repository record for High-Level Resource Binding and Allocation for Power and Performance Optimization (opens in a new tab)

  2. Temperature and Interconnect Aware Unified Physical and High Level Synthesis

    … with temperature-aware task scheduling, resource binding, and floorplanning. Compared to conventional low-power synthesis methods, our approach is effective in synthesizing circuits with lower chip temperatures and more uniform thermal distributions, with temperature reductions up to 23% …

    usf Repository record for Temperature and Interconnect Aware Unified Physical and High Level Synthesis (opens in a new tab)

  3. Integrating multiple clusters for compute-intensive applications

    … of a task container that allows one to decouple resource allocation from resource binding. It employs static load balancing for task container distribution and dynamic load balancing for task assignment. The slowest resources become useful rather than be bottlenecks in this manner. A cluster …

    lsu-thes Repository record for Integrating multiple clusters for compute-intensive applications (opens in a new tab)

  4. A Methodology to Design Pipelined Simulated Annealing Kernel Accelerators on Space-Borne Field-Programmable Gate Arrays

    … the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different cost functions and problem sizes. These test cases were benchedmarked for execution time, resource usage, power, and …

    utahstate Repository record for A Methodology to Design Pipelined Simulated Annealing Kernel Accelerators on Space-Borne Field-Programmable Gate Arrays (opens in a new tab)

  5. Designing Effective Logic Obfuscation: Exploring Beyond Gate-Level Boundaries

    … security in processor ICs. We then develop resource binding algorithms for high-level synthesis that optimally bind operations onto obfuscated functional units to amplify security guarantees. In both cases, we show that by designing logic obfuscation using architectural context a designer …

    maryland Repository record for Designing Effective Logic Obfuscation: Exploring Beyond Gate-Level Boundaries (opens in a new tab)