Advertisement

An evolutionary algorithm for the routing of multi-chip modules

  • Jens Lienig
  • Holger Brandt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 866)

Abstract

The routing of a multi-chip module is the process of designing the layout of the electrical interconnections between the components of this multi-chip module. We present an evolutionary algorithm as a novel approach for this optimization problem. The representation scheme of the routing structures and the operators associated with the proposed algorithm are described. The performance of the algorithm is tested on different multi-chip modules and it is shown that the quality of our routing results outperforms heuristically achieved routing structures of these multi-chip modules.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bäck, T., Schwefel, H.-P.: An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation 1 No. 1 (1993) 1–23Google Scholar
  2. 2.
    Chen, Y.-A., Lin, Y.-L., Hsu, Y.-C.: A New Global Router for ASIC Design Based on Simulated Evolution. Proc. International Symposium VLSI Technology, Systems, and Applications, Taipei, Taiwan, (1989)Google Scholar
  3. 3.
    Geraci, M., Orlando, P., Sorbello, F., Vasallo, G.: A Genetic Algorithm for the Routing of VLSI Circuits. Euro Asic '91 (1991) 218–223Google Scholar
  4. 4.
    Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley Publishing Company (1989)Google Scholar
  5. 5.
    Goldberg, D. E.: Genetic and Evolutionary Algorithms Come of Age. Communications of the Association for Computing Machinery (CACM) 37 No. 3 (1994) 113–119Google Scholar
  6. 6.
    Hightower, D. W.: A Solution to Line-Routing Problems on the Continuous Plane. Proc. of IEEE Design Automation Workshop (1969) 1–24Google Scholar
  7. 7.
    Lee, C. Y.: An Algorithm for Path Connections and its Applications. IRE-Trans. on Electronic Computers (1961) 346–365Google Scholar
  8. 8.
    Lienig, J., Thulasiraman, K., Swamy, M. N. S.: Routing Algorithms for Multi-Chip Modules. Proc. of the European Design Automation Conference (1992) 133–136Google Scholar
  9. 9.
    Lienig, J., Thulasiraman, K.: A Genetic Algorithm for Channel Routing in VLSI Circuits. Evolutionary Computation 1 No. 4 (1994) 293–311Google Scholar
  10. 10.
    Lin, Y.-L., Hsu, Y.-C., Tsai, F.-S.: SILK: A Simulated Evolution Router. IEEE Trans. on Computer-Aided Design 8 No. 10 (1989) 1108–1114CrossRefGoogle Scholar
  11. 11.
    Prahlada Rao, B. B., Hansdah, R. C.: Extended Distributed Genetic Algorithm for Channel Routing. Proc. of the Fifth IEEE Symposium on Parallel and Distributed Processing (1993) 726–733Google Scholar
  12. 12.
    Rahmani, A. T., Ono, N.: A Genetic Algorithm for Channel Routing Problem. Proc. of the Fifth International Conference on Genetic Algorithms (1993) 494–498Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Jens Lienig
    • 1
  • Holger Brandt
    • 2
  1. 1.Dept. of Electrical and Computer Eng.Concordia UniversityMontrealCanada
  2. 2.Institute of Electronics TechnologyDresden University of TechnologyDresdenGermany

Personalised recommendations