DocumentCode
802068
Title
CHiRPS: a general-area parallel multilayer routing system
Author
Venkateswaran, R. ; Mazumder, P.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
Volume
142
Issue
3
fYear
1995
fDate
5/1/1995 12:00:00 AM
Firstpage
208
Lastpage
214
Abstract
A new, highly parallel model for concurrent multilayer routing, called CHiRPS (Configurable Highly Routable Parallel System), is presented. The nucleus of CHiRPS is a very flexible pathfinder that can be easily configured, even in the presence of obstacles, to generate various commonly used pattern-based routes, such as Steiner trees with single trunk, comb trees, contour-based routes, etc., that span multiple layers simultaneously. The authors employ the concept of a total grid-graph to capture the state of the routing region. The main steps of the pathfinder are based on new parallel algorithms for cycle detection, cycle elimination and tree reduction. The proposed algorithms scale well with increased problem sizes since they require only O(log N) time when given a grid-graph with up to N2 nodes. As such, they are good candidates for massively data-parallel machines
Keywords
circuit layout CAD; computational complexity; network routing; parallel algorithms; trees (mathematics); CHiRPS; Configurable Highly Routable Parallel System; Steiner trees; comb trees; concurrent multilayer routing; contour-based routes; coterie array; cycle detection; cycle elimination; general-area parallel multilayer routing system; massively data-parallel machines; parallel algorithms; pathfinder; pattern-based routes; routing region state capture; scalability; total grid-graph; tree reduction;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:19951619
Filename
392510
Link To Document