An Efficient Lower Bound Algorithm For Channel Routing (1996)
| Citations: | 6 - 0 self |
BibTeX
@MISC{Chao96anefficient,
author = {Heng-Yi Chao and Mary P. Harper},
title = {An Efficient Lower Bound Algorithm For Channel Routing},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, d max and vmax are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms successfully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experiment on some large-scale randomly generated channel routing problems shows that our lower bound algorithms are much tighter than the traditional lower bounds, and are much more efficient than Pals' algorithm [21] while obtaining similar (sometimes better) results. Keywords: CAD on VLSI, physical design, channel routing, lower bound, DAG, transitive closure. ii List of Figures 1 A CRP example, its vertical constraint graph (VCG) and horizontal constraint graph (HCG). The small boxes represent the vias. : : : : : : : : : : : : : : : : : : : : : : : 2 2 A CRP example (RKPC3) for demonstrating LB3...
