Abstract
It is generally true that routers which sequentially embed nets one at a time suffer both from their lack of foresight and lack of hindsight. They lack foresight because they fail to anticipate the consequences that embedding a net will have on those nets yet to be routed. Likewise, they lack hindsight because of their inability to modify previous routing decisions in response to the unforeseen needs of a currently routing net. The foresight problem is usually addressed with heuristic route-ordering and various congestion-avoidance strategies. Because these relatively simple measures often fail to provide reliable completion, it frequently proves necessary to attack the hindsight problem as well. This is done by giving the router a capability to rip-up previously embedded nets, which is the subject of this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
This crosstalk avoidance mechanism was extended in ANAGRAM II, and will be discussed in detail in chapter 5.
Examples shown were only several transistors on a coarse grid. Overall search was probably not greater than 100 grid points.
Obviously, we cannot allow the router to remove pieces of placed devices. Each individual tile has a tag which indicates whether it is removable (wiring) or permanent (part of a device).
This limit is about 8 megabytes for the examples in this book.
Two nets are merged by the KOAN; ANAGRAM II only routes 19 nets.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cohn, J.M., Garrod, D.J., Rutenbar, R.A., Carley, L.R. (1994). Integrated Rerouting. In: Analog Device-Level Layout Automation. The Kluwer International Series in Engineering and Computer Science, vol 263. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2756-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2756-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6189-3
Online ISBN: 978-1-4615-2756-5
eBook Packages: Springer Book Archive