Solving hard instances of FPGA routing with a congestion-optimal restrained-norm path search space

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2007, Pages 151-158

  So, Keith ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

FPGA; Negotiated congestion; Routability driven routing

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; ITERATIVE METHODS; NETWORK ROUTING; ROUTERS;

CONGESTION COST; NEGOTIATED CONGESTION; PATH CANDIDATE EVALUATION; ROUTABILITY DRIVEN ROUTING;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 34748900720     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1231996.1232026     Document Type: Conference Paper

References (19)

1. Vaughn Betz. The "FPGA Place and Route Challenge". http://www.eecg.toronto.edu/~vaughn/challenge/challenge.html.
2. Vaughn Betz and Jonathan Rose. VPR: A new packing, placement and routing tool for FPGA research. In Proceedings of the 7th International Workshop on Field Programmable Logic, 1997.
3. Vaughn Betz, Jonathan Rose, and Alexander Marquardt. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers, 1999.
4. Pak K. Chan and Martine D. F. Schlag. New parallelization and convergence results for NC: A negotiation-based FPGA router. In Proceedings of the 8th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 165-174, 2000.
5. Nak Woong Eum, Taewhan Kim, and Chong Min Kyung. A router for symmetrical FPGAs based on exact routing density evaluation. In Proceedings of the 2001 IEEE/ACM International Conference on Computer-aided Design, pages 137-143, 2001.
6. Ryan Fung, Vaughn Betz, and William 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.
7. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determiniation of minimum cost paths. IEEE Trans. Syst. Sci. Cybernetics, 4:100-107, 1968.
8. Rajeev Jayaraman. Physical design for FPGAs. In Proceedings of the 2001 International Symposium on Physical Design, pages 214-221, 2001.
9. Seokjin Lee, Yongseok Cheon, and Martin D. F. Wong. A min-cost flow based detailed router for FPGAs. In Proceedings of the 2003 IEEE/ACM International Conference on Computer-aided Design, pages 389-393, 2003.
10. Seokjin Lee and Martin 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, April 2003.
11. Seokjin Lee, Hua Xiang, D. F. Wong, and Richard Y. Sun. Wire type assignment for FPGA routing. In Proceedings of the 11th ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pages 61-67, 2003.
12. Guy G. F. Lemieux, Stephen D. Brown, and Daniel Vranesic. On two-step routing for FPGAs. In Proceedings of the 1997 International Symposium on Physical design, pages 60-66, 1997.
13. Larry McMurchie and Carl Ebeling. PathFinder: A negotiation-based performance-driven router for FPGAs. In Proceedings of the 3rd International ACM Symposium on Field Programmable Gate Arrays, 1995.
14. Gi-Joon Nam, Karem A. Sakallah, and Rob A. Rutenbar. Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based boolean SAT. In Proceedings of the 7th ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA '99), pages 167-175, 1999.
15. Steven W. Oldridge and Steven J.E. Wilton. Placement and routing for FPGA architectures supporting wide shallow memories. In Proceedings of the 2003 IEEE International Conference on Field Programmable Technology, pages 154-161, 2003.
16. Jonathan Rose and Dwight Hill. Architectural and physical design challenges for one-million gate FPGAs and beyond. In Proceedings of the 5th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pages 129-132, 1997.
17. Akshay Sharma, Carl Ebeling, and Scott 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.
18. Steven 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.
19. R. Glenn Wood and Rob A. Rutenbar. FPGA routing and rout ability estimation via, boolean satisfiability. In Proceedings of the 5th ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA '97), pages 119-125, 1997.