Abstract
In this paper we present experiments concerning the feasibility of using genetic algorithms to efficiently build the global routing in lookup-table based FPGAs. The algorithm is divided in two steps: first, a set of viable routing alternatives is pre-computed for each net, and then the genetic algorithm selects the best routing for each one of the nets that offers the best overall global routing. Our results are comparable to other available global routers, so we conclude that genetic algorithms can be used to build competitive global routing tools.
This work was partially supported by the Portuguese Ministry of Science and High Education, under program POSI
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lemieux, G., Brown, S., Vranesic, D.: On two-step routing for FPGAs. In: International Symposium on Physical Design (Abril 1997)
Goldber, D.: Genetic Algorithms in Search, optimization and machine learning. Addison Wesley, Reading (1989)
Mitchel, M.: An introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Alexander, M., Robins, G.: New performance-driven FPGA routing algorithms. In: Design Automation Conference (June 1995)
Brown, G., Rose, Z., Vranesic, G.: A detailed router for Field-Programmable gate arrays. IEEE Transactions on Computer-Aided Design 11(5) (May 1992)
Palczewski, M.: Plane parallel A* maze router and it’s application to FPGA’s. In: Proceedings of the Design Automation Conference (1992)
Alexander, M., Robins, G.: New performance-driven FPGA routing algorithms. In: Design Automation Conference (June 1995)
Alexander, M., Cohoon, J., Ganley, J., Robins, G.: Performance-oriented placement and routing for Field-Programmable gate arrays. In: European Design Automation Conference (September 1995)
Alexander, M., Robins, G.: New performance-driven FPGA routing algorithms. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 15(12) (December 1996)
Betz, V., Rose, J.: Directional bias and Non-uniformity in FPGA global routing architectures. In: IEEE/ACM International Conference on Computer Aided Design (1996)
Rose, J.: LocusRoute: A parallel global router for standard cells. In: Proceedings of the Design Automation Conference (1988)
Lemieux, G., Brown, S.: A detailed routing algorithm for allocating wire segments in field-programmable gate arrays. In: Proceedings of the ACM Physical Design Workshop (1993)
Lee, Y., Wu, A.: A performance and routability driven router for FPGAs considering path delays. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 16(2) (February 1997)
Cong, J., Wu, C.: Optimal FPGA mapping and retiming with efficient initial state computation. In: Proceedings of the 35th Design Automation Conference (1998)
Chang, S.-C., Marek-Sadowska, M., Hwang, T.: Technology mapping for TLU FPGA’s based on decomposition of binary decision diagrams. IEEE Transactions on computer aided design of integrated circuits and systems 15(10) (1996)
Chen, C.-S., Tsay, Y.-W., Hwang, T., Wu, A., Lin, Y.-L.: Combining technology mapping and placement for delay-minimization in FPGA designs. IEEE, Los Alamitos
Mazumder, P., Rudnik, E.: Genetic Algorithms for VLSI design, layout & test automation. Prentice Hall, Englewood Cliffs (1999): ISBN 0-13-011566-5
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1 (1959)
CAD Benchmarking Laboratory, North Carolina State University, LGSynth93 suite, http://www.cbl.ncsu.edu/www/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barreiros, J., Costa, E. (2003). Global Routing for Lookup-Table Based FPGAs Using Genetic Algorithms. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-45234-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40822-2
Online ISBN: 978-3-540-45234-8
eBook Packages: Springer Book Archive