DocumentCode
3144189
Title
A "Greedy" Channel Router
Author
Rivest, Rouald L. ; Fiduccia, Charles M.
Author_Institution
MIT Laboratory for Computer Science, Cambridge, MA
fYear
1982
fDate
14-16 June 1982
Firstpage
418
Lastpage
424
Abstract
We present a new, "greedy", channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more than one track more than required by channel density. (It may be forced in rare cases to make a few connections "off the end" of the channel, in order to succeed.) It assumes that all pins and wiring lie on a common grid, and that vertical wires are on one layer, horizontal on another. The greedy router wires up the channel in a left-to-right, column-by-column manner, wiring each column completely before starting the next. Within each column the router tries to maximize the utility of the wiring produced, using simple, "greedy" heuristics. It may place a net on more than one track for a few columns, and "collapse" the net to a single track later on, using a vertical jog. It may also use a jog to move a net to a track closer to its pin in some future column. The router may occasionally add a new track to the channel, to avoid "getting stuck".
Keywords
Circuits; Computer science; Heuristic algorithms; Laboratories; Pins; Radio access networks; Research and development; Routing; Wires; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1982. 19th Conference on
Conference_Location
Las Vegas, NV, USA
ISSN
0146-7123
Print_ISBN
0-89791-020-6
Type
conf
DOI
10.1109/DAC.1982.1585533
Filename
1585533
Link To Document