A performance and routablity driven router for FPGAs considering path delays
- 1 January 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 557-561
- https://doi.org/10.1145/217474.217588
Abstract
[[abstract]]This paper presents a new performance and routability driven router for symmetrical array based Field Programmable Gate Arrays (FPGAs). The objectives of our proposed routing algorithm are twofold: (1) improve the routability of the design (i.e., minimize the maximum required routing channel density) and (2) improve the overall performance of the design (i.e., minimize the overall path delay). Initially, nets are routed sequentially according to their criticalities and routabilities. The nets/paths violating the routing resource and timing constraints are then resolved iteratively by a rip-up-and-rerouter, which is guided by a simulated evolution based optimization technique. The proposed algorithm considers the path delays and routability throughout the entire routing process. Experimental results show that our router can significantly improve routability and reduce delay over many existing routing algorithms.[[fileno]]2030214030018[[department]]資訊工程學This publication has 0 references indexed in Scilit: