Algorithms for VLSI routing. [Very Large Scale Integration, semiconductor chip design]
Thesis/Dissertation
·
OSTI ID:6043677
This thesis considers the problems arising from VLSI routing design. Algorithms are proposed for solving both global and local routing problems. For routing multiterminal nets in the gate array and sea-of-gates technologies, the author presents a global router which upper bounds the global density of the routing by 2s*, where s* is the span of the nets. For standard cell technology, he presents a global router which achieves the optimal horizontal density while upper bounding the vertical density by 2s*. The parallel implementations of the proposed global routing algorithms are presented.
- Research Organization:
- Illinois Univ., Urbana, IL (United States)
- OSTI ID:
- 6043677
- Country of Publication:
- United States
- Language:
- English
Similar Records
Automated routing method for VLSI with three interconnection layers
Routing algorithms in the physical design of VLSI circuits
Incremental placement and routing of VLSI macrocells
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6624895
Routing algorithms in the physical design of VLSI circuits
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6103949
Incremental placement and routing of VLSI macrocells
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6089967