A sequential detailed router for huge grid graphs

Author

Hetzel, Asmus

Author_Institution

Res. Inst. for Discrete Math., Bonn Univ., Germany

fYear

1998

fDate

23-26 Feb 1998

Firstpage

332

Lastpage

338

Abstract

Sequential routing algorithms using maze-running are very suitable for general over-the-cell-routing but suffer often from the high memory or runtime requirements of the underlying path search routine. A new algorithm for this subproblem is presented that computes shortest paths in a rectangular grid with respect to euclidean distance. It achieves performance and memory requirements similar to fast line-search algorithms while still being optimal. An additional application for the computation of minimal rip-up sets is presented. Computational results are shown for a detailed router based on these algorithms that is used for the design of high performance CMOS processors at IBM

Keywords

CMOS digital integrated circuits; VLSI; circuit layout CAD; integrated circuit layout; network routing; search problems; CMOS processor design; IC layout; XRouter package; euclidean distance; huge grid graphs; maze-running; minimal rip-up sets; over-the-cell-routing; path search algorithm; sequential detailed router; sequential routing algorithms; shortest path computation; Algorithm design and analysis; Computer applications; Cost function; Euclidean distance; Grid computing; High performance computing; Mathematics; Routing; Runtime; Wiring;

fLanguage

English

Publisher

ieee

Conference_Titel

Design, Automation and Test in Europe, 1998., Proceedings

Conference_Location

Paris

Print_ISBN

0-8186-8359-7

Type

conf

DOI

10.1109/DATE.1998.655877

Filename

655877