Iterative and adaptive slack allocation for performance-driven layout and FPGA routing

• Published in: [1992] Proceedings 29th ACM/IEEE Design Automation Conference pp. 536 - 542
• Main Author: Frankle, J.
• Format: Conference Proceeding
• Language: English
• Published: IEEE Comput. Soc. Press 1992
• Subjects: Clocks; Delay estimation; Field programmable gate arrays; Logic; Performance analysis; Pins; Registers; Routing; Timing; Upper bound
• ISBN: 9780818628221; 0818628227
• ISSN: 0738-100X
• DOI: 10.1109/DAC.1992.227746

The authors gives a generalization, called the limit-bumping algorithm (LBA), of a procedure of H. Youssef et al. (1990) that transforms initial connection delays into upper limits on delay suitable for performance-driven layout. LBA is a simple way to distribute slacks using arbitrary allocation functions. It is shown that lower and upper bounds on connection delays can be used in the computation of upper limits for initial layout and for layout improvement. The methods have been integrated into a delay-sensitive router for field programmable gate arrays (FPGAs). In 22 standard benchmark designs, feasible system clock periods were reduced in every case by an average of 14% and as much as 32%.< >