The Community for Technology Leaders
Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
ISBN: 0-8186-0864-1
pp: 189-195
Rose , Comput. Syst. Lab., Stanford Univ., CA, USA
ABSTRACT
A fast and easily parallelizable global routing algorithm for standard cells and its parallel implementation are presented. LocusRoute is meant to be used as the cost function for a placement algorithm, and so this context constrains the structure of the global routing algorithm and its parallel implementation. The router is based on enumerating a subset of all two-bend routes between two points, and results in 16% to 37% fewer total number of tracks than the Timber Wolf global router for standard cells. It is comparable in quality to a maze router and an industrial router, but is ten times or more faster. Three approaches to parallelizing the router are implemented: wire-by-wire parallelism, segment-by-segment and route-by-route. Two of these approaches achieve significant speedup; route-by-route achieves up to 4.6 using eight processors, and wire-by-wire achieves from 5.8 to 7.6 on eight processors.
INDEX TERMS
segment-by-segment parallelism, route-by-route parallelism, VAX 11/780 computer, parallel global router, global routing algorithm, standard cells, LocusRoute, placement algorithm, Timber Wolf global router, maze router, industrial router, wire-by-wire parallelism
CITATION

Rose, "LocusRoute: a parallel global router for standard cells," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 189-195.
doi:10.1109/DAC.1988.14757
88 ms
(Ver 3.3 (11022016))