Abstract
In addition to optimizing for long-path timing and routability, commercial FPGA routing engines must also optimize for various timing constraints, enabling users to fine tune their designs. These timing constraints involve both long- and short-path timing requirements. The intricacies of commercial FPGA architectures add difficulty to the problem of supporting such constraints. In this work, we introduce specific delay window routing as a general method for optimization during the routing stage of the FPGA design flow, which can be applied to various timing constraints constituting both long- and short-path requirements. Furthermore, we propose a key adjustment to standard FPGA routing technology for the purposes of specific delay window routing. By using dual-wave expansion instead of traditional single-wave expansion, we solve the critical issue of inaccurate delay estimation in our wave search, which would otherwise make routing according to a specific delay window difficult. Our results show that this dual-wave method can support stricter timing constraints than the standard single-wave method. For a suite of designs with constraints requiring connections to meet a target delay within 250ps, our dual-wave method could satisfy the requirement for all designs, whereas the single-wave method failed for more than two thirds of the designs.
- J. Frankle. 1992. Iterative and adaptive slack allocation for performance-driven layout and FPGA routing. In Proceedings of the 29th ACM/IEEE Design Automation Conference (DAC’92). IEEE, Los Alamitos, CA, 536--542. http://dl.acm.org/citation.cfm?id=113938.149626 Google Scholar
Digital Library
- R. Fung, V. Betz, and W. Chow. 2008. Slack allocation and routing to improve FPGA timing while repairing short-path violations. Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 4, 686--697. DOI:http://dx.doi.org/10.1109/TCAD.2008.917585 Google Scholar
Digital Library
- P. E. Hart, N. J. Nilsson, and B. Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4, 2, 100--107. DOI:http://dx.doi.org/10.1109/TSSC.1968.300136Google Scholar
Digital Library
- Peter S. Hauge, Ravi Nair, and Ellen J. Yoffa. 1987. Circuit Placement for Predictable Performance. IBM Thomas J. Watson Research Center, Yorktown Heights, NY.Google Scholar
- Eddie Hung, Joshua M. Levine, Edward Stott, George A. Constantinides, and Wayne Luk. 2015. Delay-bounded routing for shadow registers. In Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA’15). ACM, New York, NY, 56--65. DOI:http://dx.doi.org/10.1145/2684746.2689075 Google Scholar
Digital Library
- C. Y. Lee. 1961. An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10, 3, 346--365. DOI:http://dx.doi.org/10.1109/TEC.1961.5219222Google Scholar
Cross Ref
- Larry McMurchie and Carl Ebeling. 1995. PathFinder: A negotiation-based performance-driven router for FPGAs. In Proceedings of the 1995 ACM 3rd International Symposium on Field-Programmable Gate Arrays (FPGA’95). ACM, New York, NY, 111--117. DOI:http://dx.doi.org/10.1145/201310.201328 Google Scholar
Digital Library
- Frank Rubin. 1974. The Lee path connection algorithm. IEEE Transactions on Computers C-23, 9, 907--914. DOI:http://dx.doi.org/10.1109/T-C.1974. 224054 Google Scholar
Digital Library
- Evan Wegley and Qinhai Zhang. 2015. Application of specific delay window routing for timing optimization in FPGA designs. In Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA’15). ACM, New York, NY, 37--45. DOI:http://dx.doi.org/10.1145/2684746.2689059 Google Scholar
Digital Library
- H. Youssef and E. Shragowitz. 1990. Timing constraints for correct performance. In Proceedings of the 1990 IEEE International Conference on Computer-Aided Design (ICCAD’90). 24--27. DOI:http://dx.doi.org/10.1109/ICCAD.1990.129830Google Scholar
Index Terms
Application of Specific Delay Window Routing for Timing Optimization in FPGA Designs
Recommendations
Application of Specific Delay Window Routing for Timing Optimization in FPGA Designs
FPGA '15: Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysIn addition to optimizing for timing performance and routability, commercial FPGA routing engines must also support various timing constraints enabling the designer to fine tune aspects of their design. The many intricacies of commercial FPGA ...
Slack Allocation and Routing to Improve FPGA Timing While Repairing Short-Path Violations
This paper presents the first published algorithm to simultaneously optimize both short- and long-path timing in a field-programmable gate array (FPGA): the routing cost valleys (RCV) algorithm. RCV consists of the following two components: a new slack-...
Advanced PROPHET Routing in Delay Tolerant Network
ICCSN '09: Proceedings of the 2009 International Conference on Communication Software and NetworksTo solve routing jitter problem in PROPHET in delay tolerant network, advanced PROPHET routing is proposed in this paper. Average delivery predictabilities are used in advanced PROPHET to avoid routing jitter. Furthermore, we evaluate it through ...






Comments