Title :
Algorithms for Global Routing
Author_Institution :
Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA
Abstract :
This paper presents several algorithms for global routing, including a very fast shortest path connection algorithm based on wave propagation and diffraction, a heuristic minimum tree algorithm using ´Common Edge´ analysis, an overflow control method, and global rerouting treatment. These algorithms have been implemented in C and very good experimental results have been obtained.
Keywords :
Algorithm design and analysis; Data structures; Design automation; Diffraction; Heuristic algorithms; Joining processes; Laboratories; Routing;
Conference_Titel :
Design Automation, 1986. 23rd Conference on
Print_ISBN :
0-8186-0702-5
DOI :
10.1109/DAC.1986.1586184
