Shortest path search using tiles and piecewise linear cost propagation

Authors:
Zhaoyun Xing;R. Kao
Affiliations:
Sun Microsystems Labs., Palo Alto, CA;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 4

A 4-geometry maze router and its application on multiterminal nets

ACM Transactions on Design Automation of Electronic Systems (TODAES)
An efficient tile-based ECO router with routing graph reduction and enhanced global routing flow

Proceedings of the 2005 international symposium on Physical design
NEMO: a new implicit connection graph-based gridless router with multi-layer planes and pseudo-tile propagation

Proceedings of the 2006 international symposium on Physical design
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we propose a new algorithm for finding shortest paths in a tile connection graph. This algorithm uses an exact piecewise linear cost model to guide our search of the compact tile graph. Unlike previous tile search algorithms, this algorithm always rinds a shortest path. Unlike the grid graph algorithms (which do find shortest paths), this algorithm searches the tile graph which is much smaller than the grid graph. The efficiency of our new approach is confirmed by our experiments comparing our new algorithm with the grid graph algorithms