Skip to main content
Log in

Multiterminal global routing: A deterministic approximation scheme

Algorithmica Aims and scope Submit manuscript

Abstract

We consider the problem of routing multiterminal nets in a two-dimensional gate-array. Given a gate-array and a set of nets to be routed, we wish to find a routing that uses as little channel space as possible. We present a deterministic approximation algorithm that uses close to the minimum possible channel space. We cast the routing problem as a new form of zero-one multicommodity flow, an integer-programming problem. We solve this integer program approximately by first solving its linear-program relaxation and then rounding any fractions that appear in the solution to the linear program. The running time of the rounding algorithm is exponential in the number of terminals in a net but polynomial in the number of nets and the size of the array. The algorithm is thus best suited to cases where the number of terminals on each net is small.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Beck and T. Fiala, “Integer-Making” Theorems,Discrete Applied Mathematics, vol. 3, no. 1, pp. 1–8, February 1981.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Burstein and R. Pelavin, Hierarchical Wire Routing,IEEE Transactions on Computer-Aided Design, vol. 2, no. 4, pp. 223–234, October 1983.

    Article  Google Scholar 

  3. N. Karmarkar, A New Polynomial-Time Algorithm for Linear Programming,Combinatorica, vol. 4, no. 4, pp. 373–396, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. M. Karp, F. T. Leighton, C. D. Thompson, R. I. Rivest, U. V. Vazirani, and V. V. Vazirani, Global Wire Routing in Two-Dimensional Arrays,Proceedings of the 24th Annual IEEE Symposium on FOCS, pp. 453–459, October 1983. Also submitted toAlgorithmica.

  5. S. Kirkpatrick and M. P. Vecchi, Global Wiring by Simulated Annealing,IEEE Transactions on Computer-Aided Design, vol. 2, no. 4, pp. 215–222, October 1983.

    Google Scholar 

  6. C. Y. Lee, An Algorithm for Path Connections and Its Applications,IRE Transactions on Electronic Computers, vol. 10, pp. 346–365, September 1961.

    Article  Google Scholar 

  7. V. M. Malhotra, M. P. Kumar, and S. N. Maheshwari, AnOV¦3) Algorithm for Finding Maximum Flows in Networks,Information Processing Letters, vol. 7, pp. 277–278, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. P.-C. Ng, P. Raghavan, and C. D. Thompson, Experimental Results with a Linear Program Global Router,Computers and Artificial Intelligence, vol. 6, no. 3, pp. 229–242, 1987.

    Google Scholar 

  9. J. E. Olson and J. Spencer, Balancing Families of Sets,Journal of Combinatorial Theory, Series A, vol. 25, no. 1, pp. 29–37, July 1978.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Raghavan, Randomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems, Ph.D. Thesis, Technical Report UCB/CSD/87/ 312, University of California, Berkeley, October 1986.

    Google Scholar 

  11. P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,Proceedings of the 27th Annual IEEE Symposium on FOCS, October 1986.

  12. P. Raghavan and C. D. Thompson, Provably Good Routing in Graphs: Regular Arrays,Proceedings of the 24th ACM STOC, pp. 79–87, May 1985.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by F. Thomson Leighton.

This work was done while the authors were with the Computer Science Division, University of California at Berkeley. The work of Prabhakar Raghavan was supported by an IBM Doctoral Fellowship, and the work of Clark Thompson was supported by a California State MICRO grant (AT&T Foundation).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raghavan, P., Thompson, C.D. Multiterminal global routing: A deterministic approximation scheme. Algorithmica 6, 73–82 (1991). https://doi.org/10.1007/BF01759035

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01759035

Key words

Navigation