Enforcing long-path timing closure for FPGA routing with path searches on clamped lexicographic spirals

ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA

Volumn , Issue , 2008, Pages 24-33

  So, Keith ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

FPGA; Lexicographic search; Negotiated congestion; Timing driven routing

Indexed keywords

BUDGET DISTRIBUTION; COST STRUCTURE; FPGA; FPGA DESIGN; FPGA IMPLEMENTATIONS; GREEDY ALGORITHMS; LEGAL SOLUTIONS; LEXICOGRAPHIC SEARCH; LONG-PATH; NEGOTIATED CONGESTION; ORDERED MONOIDS; PATH SEARCH; PERFORMANCE-DRIVEN; POLYNOMIAL-TIME; ROUTING TREES; RUNTIMES; SOLUTION QUALITY; TIMING-DRIVEN; TIMING-DRIVEN ROUTING;

BUDGET CONTROL; DATA STRUCTURES; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); LOGIC GATES; ROUTERS; TIME MEASUREMENT;

ROUTING ALGORITHMS;

EID: 67650668087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1344671.1344677     Document Type: Conference Paper

References (32)

1. M. J. Alexander and G. Robins. New performance-driven FPGA routing algorithms. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation, pages 562-567. ACM Press, 1995.
2. J. H. Anderson, S. Nag, K. Chaudhary, S. Kalman, C. Madabhushi, and P. Cheng. Run-time-conscious automatic timing-driven FPGA layout synthesis. In Proceedings of the 14th International Confernece on Field Programmable Logic and Applications, pages 168-178, 2004.
3. V. Betz. The FPGA place and route challenge. http://www.eecg.toronto.edu/ ̃vaughn/challenge/challenge.html.
4. V. Betz and J. Rose. VPR: A new packing, placement and routing tool for FPGA research. In Proceedings of the 7th International Workshop on Field Programmable Logic, 1997.
5. V. Betz, J. Rose, and A. Marquardt. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers, 1999.
6. M. Cho, K. Lu, K. Yuan, and D. Z. Pan. BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router. In ICCAD '07: Proceedings of the 2007 IEEE/ACM International Conference on Computer-aided Design, pages 503-508, Piscataway, NJ, USA, 2007. IEEE Press.
7. J. Frankle. Iterative and adaptive slack allocation for performance-driven layout and FPGA routing. In DAC '92: Proceedings of the 29th ACM/IEEE conference on Design automation, pages 536-542, Los Alamitos, CA, USA, 1992. IEEE Computer Society Press.
8. E. Fredkin. Trie memory. Communications of the ACM, 3(9):490-499, Sept. 1960.
9. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987.
10. R. Fung, V. Betz, and W. Chow. Simultaneous short-path and long-path timing optimization for FPGAs. In Proceedings of the 2004 IEEE/ACM International Conference on Computer-aided Design, pages 838-845, 2004.
11. S. Ghiasi, E. Bozorgzadeh, S. Choudhuri, and M. Sarrafzadeh. A unified theory of timing budget management. In ICCAD '04: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, pages 653-659, Washington, DC, USA, 2004. IEEE Computer Society.
12. M. Hutton and V. Betz. FPGA synthesis and physical design. In L. Scheffer, L. Lavagno, and G. Martin, editors, Electronic Design Automation for Integrated Circuits Handbook, volume 1, chapter 13. Taylor and Francis CRC Press, 2006.
13. R. Jayaraman. Physical design for FPGAs. In Proceedings of the 2001 International Symposium on Physical Design, pages 214-221, 2001.
14. N. Kafafi, K. Bozman, and S. J. E. Wilton. Architectures and algorithms for synthesizable embedded programmable logic cores. In Proceedings of the 11th ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2003.
15. K. K. Lee and M. D. F. Wong. LRoute: A delay minimal router for hierarchical CPLDs. In Proceedings of the 9th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 12-20, 2001.
16. S. Lee and M. D. F. Wong. Timing-driven routing for FPGAs based on Lagrangian relaxation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 22(4):506-511, Apr. 2003.
17. Y.-S. Lee and A. C.-H. Wu. A performance and routablity driven router for FPGAs considering path delays. In Proceedings of the 32nd Design Automation Conference, pages 557-561, 1995.
18. A. Marquardt, V. Betz, and J. Rose. Timing-driven placement for FPGAs. In Proceedings of the 8th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 203-213, 2000.
19. L. McMurchie and C. Ebeling. PathFinder: A negotiation-based performance-driven router for FPGAs. In Proceedings of the 3rd International ACM Symposium on Field Programmable Gate Arrays, 1995.
20. M. D. Moffitt. MaizeRouter: Engineering an effective global router. In Proceedings of the 13th Asia and South Pacific Design Automation Conference, 2008.
21. S. K. Nag and R. A. Rutenbar. Performance-driven simultaneous place and route for island-style FPGAs. In Proceedings of the 1995 IEEE/ACM International Conference on Computer Aided Design, pages 332-338, 1995.
22. G.-J. Nam, M. Yildiz, D. Z. Pan, and P. H. Madden. ISPD placement contest updates and ISPD 2007 global routing contest. In ISPD '07: Proceedings of the 2007 International Symposium on Physical Design, page 167, New York, NY, USA, 2007. ACM.
23. M. M. Ozdal and M. D. F. Wong. Archer: a history-driven global routing algorithm. In Proceedings of the 2007 IEEE/ACM International Conference on Computer-aided design, pages 488-495, Piscataway, NJ, USA, 2007. IEEE Press.
24. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Series in Artificial Intelligence. Addison-Wesley, 1984.
25. J. A. Roy and I. L. Markov. High-performance routing at the nanometer scale. In Proceedings of the 2007 IEEE/ACM International Conference on Computer-aided Design, pages 496-502, Piscataway, NJ, USA, 2007. IEEE Press.
26. A. Sharma, C. Ebeling, and S. Hauck. PipeRoute: A pipelineing-aware router for FPGAs. In Proceedings of the 11th ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pages 68-77, 2003.
27. K. So. Lexicographic Path Searches for FPGA Routing. PhD thesis, School of Computer Science and Engineering, University of New South Wales, Sydney, Australia, Sept. 2007.
28. K. So. Solving hard instances of FPGA routing with a congestion-optimal restrained-norm path search space. In ISPD '07: Proceedings of the 2007 International Symposium on Physical Design, pages 151-158, New York, NY, USA, 2007. ACM Press.
29. E. W. Weisstein. Monoid. From MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/Monoid.html.
30. S. J. E. Wilton. A crosstalk-aware timing-driven router for FPGAs. In Proceedings of the 9th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 21-28, 2001.
31. H. Youssef, R.-B. Lin, and E. Shragowitz. Bounds on net delays for VLSI circuits. IEEE Trans. Circuits Syst. II, 39(11):815-824, Nov. 1992.
32. H. Youssef and E. Shragowitz. Timing constraints for correct performance. In Proceedings of the 1990 IEEE/ACM International Conference on Computer-aided Design, pages 24-27, 1990.