We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A FAST AND EFFECTIVE TIMING-DRIVEN PLACEMENT TOOL FOR FPGAs.
- Authors
KHALID, MOHAMMED A. S.; YONGHONG XU
- Abstract
In this paper, we present TQPF, a Timing-Driven Quadratic-based Placement Tool for FPGAs. Quadratic placement algorithms try to minimize total squared wire length by solving linear equations. The resulting placement tends to locate all cells near the center of the chip with a large amount of overlap. Also, since squared wire length is only an indirect measure of linear wire length, the resulting total wire length may not be minimized. We propose methods to alleviate the above two problems that give high-quality results while minimizing the total run time. We incorporate multiple iterations of equation-solving process together with a technique for pulling nodes out of the dense area while minimizing linear wire length. Experimental results using 20 Microelectronics Center of North Carolina (MCNC) benchmark circuits show that, on average, TQPF is approximately three times faster than the well-known Versatile Placement and Routing tool for FPGAs (VPR). The estimated total wire length, on average, is only 1.4% longer, and the critical path delay is 4.9% lower.
- Subjects
FIELD programmable gate arrays; ALGORITHMS; EQUATIONS; INTEGRATED circuits; WIRE; ROUTING (Computer network management); MICROELECTRONICS Center of North Carolina (Company)
- Publication
Journal of Circuits, Systems & Computers, 2008, Vol 17, Issue 4, p663
- ISSN
0218-1266
- Publication type
Article
- DOI
10.1142/S0218126608004526