Continuous Global Routing

Daniel Blankenburg (), Stefan Rabenstein () and Pietro Saccardi ()
Additional contact information
Daniel Blankenburg: University of Bonn
Stefan Rabenstein: University of Bonn
Pietro Saccardi: University of Bonn

A chapter in Operations Research Proceedings 2024, 2025, pp 174-180 from Springer

Abstract: Abstract We pick up a global routing model using rhomboidal tiles due to Hähnle and Saccardi and expand on their ideas. We add continuous via costs to their model and introduce a polyhedral description of rectilinear graphs with a fixed structure. Using this description, we derive a proof that minimum cost Steiner trees, rather than paths, lie on the rhomboidal Hanan grid and extend goal-oriented path search techniques to the rhomboidal model. We prove the competitiveness of this continuous routing approach by comparing subsequent detailed routing results to a traditional global router on the 5 nm technology node.

Keywords: VLSI design; Global routing; Continuous routing (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-92575-7_24

Ordering information: This item can be ordered from
http://www.springer.com/9783031925757

DOI: 10.1007/978-3-031-92575-7_24

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().