Title :
A force-directed maze router
Author :
Mo, F. ; Tabbara, A. ; Brayton, R.K.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Abstract :
A new routing algorithm is presented. It is based on a multiple star net model, force-directed placement and maze searching techniques. The algorithm inherits the power of maze routing in that it is able to route complex layouts with various obstructions. The large memory requirement of the conventional maze algorithm is alleviated through successive net refinement, which constrains the maze searching to small regions. The algorithm shows advantages in routing designs with complicated layout obstructions.
Keywords :
cellular arrays; circuit layout CAD; integrated circuit layout; logic CAD; network routing; network topology; complex layouts; force-directed maze router; force-directed placement; integrated circuit layout; macro-cell placement benchmarks; maze searching; multiple star net model; obstructions; routing algorithm; successive net refinement; Algorithm design and analysis; Clocks; Design automation; Integrated circuit technology; Power system reliability; Routing; Shape; System-on-a-chip; Topology; Wires;
Conference_Titel :
Computer Aided Design, 2001. ICCAD 2001. IEEE/ACM International Conference on
Conference_Location :
San Jose, CA, USA
Print_ISBN :
0-7803-7247-6
DOI :
10.1109/ICCAD.2001.968658
