Analyzing System-Level Information%26apos;s Correlation to FPGA Placement

作者：Gharibian Farnaz^*; Shannon Lesley; Jamieson Peter; Chung Kevin

来源：ACM Transactions on Reconfigurable Technology and Systems, 2013, 6(3): UNSP 15.

DOI：10.1145/2501985

• Design
• Algorithms
• Performance
• FPGA
• placement
• clustering
• high-level information
• CAD

One popular placement algorithms for Field-Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement from a flattened design that no longer contains any high-level information related to the original design hierarchy. Placement is an NP-hard problem, and as the size and complexity of designs implemented on FPGAs increases, SA does not scale well to find good solutions in a timely fashion. In this article, we investigate if system-level information can be reconstructed from a flattened netlist and evaluate how that information is realized in terms of its locality in the final placement. If there is a strong relationship between good quality placements and system-level information, then it may be possible to divide a large design into smaller components and improve the time needed to create a good quality placement. Our preliminary results suggest that the locality property of the information embedded in the system-level HDL structure (i.e. %26quot;module%26quot;, %26quot;always%26quot;, and %26quot;if%26quot; statements) is greatly affected by designer HDL coding style. Therefore, a reconstructive algorithm, called Affinity Propagation, is also considered as a possible method of generating a meaningful coarse-grain picture of the design.

• 出版日期2013-10