iii For my wife, Cathy Without her love, patience, and support, this dissertation would never have existed. Acknowledgments The rst person to thank, of course, is my advisor, Jim Cohoon. His guidance, advice, and support have been invaluable throughout my doctoral studies. I also thank Jee Salowe, with whom I had many discussions on much of the material… (More)
We give an &Ogr;(n<supscrpt>3</supscrpt>·log n) time and &Ogr;(n<supscrpt>3</supscrpt>) space algorithm for the continuous homotopic one layer routing problem. The main contribution is an extension of the sweep paradigm to a universal cover space of the plane.
This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density <?Pub Fmt italic>d<?Pub Fmt /italic> into a so-called extended simple channel… (More)
Congestion estimation is an important issue for the success of the VLSI layout. Fast congestion estimation provides an efficient means to adjust the placement and routability. A probabilistic model of interconnections enables designers to quickly predict routing congestion. We propose a powerful and fast estimation approach which allows wires to have… (More)
Homotopic compaction is the com-paction of a VLSI layout by means of a continuous motion of layout components that preserves routability. We present the most efficient algorithm for one-dimensional homotopic compac-tion yet discovered: it requires timeO(oN 2 log N) and space O(N 2) on input of size N. These bounds are pessimistic, and practical performance… (More)
In this paper we present a parallel global routing algorithm for general cell layout. The algorithm applies a hierarchical decomposition strategy that recursively divides routing problems into simple, independent sub-problems for parallel processing. The solution of each subproblem is based on integer programming and network flow optimization. The algorithm… (More)
We show that any n-net 2-terminal channel routing problem of density d can be wired on a two-layer grid of width w = d + 0 (d 1J3) when vertical wire segments are allowed to overlap for a distance of length 1. TItis is a considerable asymptotic improvement over the best known, and optimal, channel width of 2d-l for models in which no vertical overlap is… (More)