Abstract
We propose an elegant formulation of the Maze Routing with Buffer Insertion and Wiresizing problem as a graph-theoretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic-programming based techniques. Routing constraints such as wiring obstacles and restrictions on buffer locations and types are easily incorporated in the formulation. Furthermore, efficient software routines solving shortest path problems in existing graph application libraries can be applied. We construct a BP-Graph such that the length of every path in this graph is equal to the Elmore delay. Therefore, finding the minimum Elmore delay path becomes a finite shortest path problem. The buffer choices and insertion locations are represented as the vertices in the BP-Graph. The interconnect wires are sized by constructing a look-up table for buffer-to-buffer wiresizing solutions. We also provide a technique that is able to tremendously improve the runtime. Experiments show improvements over previously proposed methods.
Original language | English |
---|---|
Title of host publication | 37th ACM/IEEE Design Automation Conference - Proceedings 2000 |
Publisher | Association for Computing Machinery (ACM) |
Pages | 374-378 |
Number of pages | 5 |
ISBN (Print) | 9781581131871, 1581131879 |
DOIs | |
Publication status | Published - 5 Jun 2000 |
Event | 37th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 2000 - Los Angeles, United States Duration: 5 Jun 2000 → 9 Jun 2000 https://dl.acm.org/doi/proceedings/10.1145/337292 (Conference proceedings) https://ieeexplore.ieee.org/xpl/conhome/6899/proceeding (Conference proceedings) |
Publication series
Name | ACM/IEEE Design Automation Conference - Proceedings |
---|---|
ISSN (Print) | 0738-100X |
Conference
Conference | 37th ACM/IEEE-CAS/EDAC Design Automation Conference, DAC 2000 |
---|---|
Country/Territory | United States |
City | Los Angeles |
Period | 5/06/00 → 9/06/00 |
Internet address |
|
Scopus Subject Areas
- Hardware and Architecture
- Control and Systems Engineering