Andere Kunden interessierten sich auch für
![Efficient methods of Cooperative Cache Partitioning]( "Efficient methods of Cooperative Cache Partitioning")
Efficient methods of Cooperative Cache Partitioning26,99 €![UNIFICATION OF VLSI PARTITIONING]( "UNIFICATION OF VLSI PARTITIONING")
UNIFICATION OF VLSI PARTITIONING38,99 €![A Practical Introduction to Computer Architecture]( "A Practical Introduction to Computer Architecture")
A Practical Introduction to Computer Architecture39,99 €![Higher-Level Hardware Synthesis]( "Higher-Level Hardware Synthesis")
Higher-Level Hardware Synthesis39,99 €![Analog and Mixed-Signal Hardware Description Language]( "Analog and Mixed-Signal Hardware Description Language")
Analog and Mixed-Signal Hardware Description Language77,99 €![Analog and Mixed-Signal Hardware Description Language]( "Analog and Mixed-Signal Hardware Description Language")
Analog and Mixed-Signal Hardware Description Language74,99 €![A Practical Guide to Verilog-A]( "A Practical Guide to Verilog-A")
A Practical Guide to Verilog-A41,99 €
We document efforts to assemble and modify a set of benchmark circuits for testing a new class of circuit partitioning algorithms designed for heterogeneous FPGAs. Often, computations can be implemented using different types of resources within these devices; the new partitioning algorithms incorporate the circuit mapping step, where computations are mapped to specific resource types, into the partitioning algorithms themselves. We elaborate on the details of this new form of partitioning, called "multi-personality" partitioning. While remapping provides a great deal of flexibility to the partitioner to modify the implementation of circuit nodes in order to meet the desired partitioning criteria, testing this new partitioner requires large, heterogeneous netlists. In this work, we develop a list of requirements for the needed benchmarks, investigate existing benchmarks to determine their suitability, and document how we adapt the chosen benchmarks for use in testing multi-personality partitioning algorithms. Finally, we also discuss initial efforts in assembling and developing a set of benchmarks for testing a new form of partitioning called content-aware circuit partitioning.