Design Automation Conference (2000)
Los Angeles, CA
June 5, 2000 to June 9, 2000
D. F. Wong , The University of Texas at Austin
Minghorng Lai , The University of Texas at Austin
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 inter connect 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.
nanotechnology, quantum cellular automata
D. F. Wong, Minghorng Lai, "Maze Routing with Buffer Insertion and Wiresizing", Design Automation Conference, vol. 00, no. , pp. 374-378, 2000, doi:10.1109/DAC.2000.855339