Abstract
In the placement phase, the exact locations of circuit blocks and pins are determined. A netlist is also generated which specifies the required inter-connections. Space not occupied by the blocks can be viewed as a collection of regions. These regions are used for routing and are called as routing regions. The process of finding the geometric layouts of all the nets is called routing. Nets must be routed within the routing regions. In addition, nets must not short-circuit, that is, nets must not intersect each other.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sherwani, N. (1995). Global Routing. In: Algorithms for VLSI Physical Design Automation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2351-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2351-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5997-5
Online ISBN: 978-1-4615-2351-2
eBook Packages: Springer Book Archive