Skip to main content
SpringerLink
Log in

A parallel algorithm for channel routing

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 344))

Included in the following conference series:

Abstract

We present an optimal NC algorithm for 2-layer channel routing of VLSI designs. Our routing algorithm achieves channel density and runs in O(logn) time using O(n) processors on an EREW P-RAM. The routing algorithm is a parallel version of the widely used Left-Edge Algorithm. It can be used to solve the maximum clique and the minimum coloring problem for interval graphs and the maximum independent set problem for co-interval graphs with optimal processor-time bounds. We give an optimizing extension to our algorithm that resolves column conflicts under certain weak conditions and runs in polylog time. The routing algorithm can easily be implemented on a multi-processor shared-memory machine so our solution has considerable practical value.

This work was supported in part by the Semiconductor Research Corporation under contract 86-07-84, the National Science Foundation under Grant DCR 83-06812, the Office of Naval Research under contract N00014-83-k-0146 and DARPA Order No. 4786.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, J. Komlos and E. Szemeredi, “An O(n log n) Sorting Network,” in 15th Annual ACM Symposium on Theory of Computing, pp. 1–9, 1983.

    Google Scholar 

  2. K. E. Batcher and H. S. Stone, “Sorting Networks and Their Applications,” AFIPS Proc., Spring Joint Comput. Conf., vol. 32, pp. 307–314, 1968.

    Google Scholar 

  3. M. Ben-Or, “Lower Bounds for Algebraic Computation Trees,” in 15th Annual ACM Symposium on Theory of Computing, pp. 80–86, May 1983.

    Google Scholar 

  4. R. Cole, “Parallel Merge Sort,” in 27th Annual Symposium on Foundations of Computer Science, pp. 511–616, 1986.

    Google Scholar 

  5. B. A. Dalio, “DeCo — A Hierarchical Device Compilation Systems” Dept. of Computer Science, Brown University, PhD Thesis CS-87-08, May 1987.

    Google Scholar 

  6. B. A. Dalio and J. E. Savage, “DeCo — A Device Compilation System,” in International Workshop on Logic and Architecture Synthesis for Silicon Compilers, May 1988.

    Google Scholar 

  7. D. N. Deutsch, “A Dogleg Channel Router,” in Proc. 13th IEEE Design Automation Conf., pp. 425–433, 1976.

    Google Scholar 

  8. D. Dobkin and R. Lipton, “On the Complexity of Computations under Varying Set of Primitives,” Journal of Computer and Systems Sciences, vol. 18, pp. 86–91, 1979.

    Google Scholar 

  9. D. Dolev, K. Karplus, A. Siegel, A. Strong and J. D. Ullman, “Optimal Wiring between Rectangles,” in 13th Annual ACM Symposium on Theory of Computing, pp. 312–317, 1981.

    Google Scholar 

  10. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York, NY, Academic Press, 1980.

    Google Scholar 

  11. A. Hashimoto and J. Stevens, “Wire Routing by Optimizing Channel Assignments within Large Apertures,” in Proc. 6th IEEE Design Automation Conf., pp. 155–163, 1971.

    Google Scholar 

  12. D. V. Heinbuch, CMOS3 Cell Library. Reading, MA, Addison Wesley, 1988.

    Google Scholar 

  13. D. Helmbold and E. Mayr, “Applications of Parallel Scheduling to Perfect Graphs,” Stanford University,, 1986.

    Google Scholar 

  14. D. S. Hirschberg, A. K. Chandra and D. V. Sarvate, “Computing Connected Components on a Computer,” CACM, vol. 22, pp. 461–464, 1979.

    Google Scholar 

  15. R. M. Karp and V. Ramachandran, “A Survey of Parallel Algorithms for Shared-Memory Machines,” in Handbook of Theoretical Computer Science. North-Holland, 1988, preprint.

    Google Scholar 

  16. P. N. Klein, “Efficient Parallel Algorithms for Chordal Graphs,” in 29th Annual Symposium on Foundations of Computer Science, to appear, 1988.

    Google Scholar 

  17. E. S. Kuh and T. Yoshimura, “Efficient Algorithms for Channel Routing,” IEEE Trans. Computer-Aided Design, vol. CAD-1, no. 1, pp. 25–35, Jan. 1982.

    Google Scholar 

  18. R. E. Ladner and M. J. Fischer, “Parallel Prefix Computation,” JACM, vol. 27, pp. 831–838, 1980.

    Google Scholar 

  19. A. S. Lapaugh, “Algorithms for Integrated Circuit Layout: an Analytic Approach,” Dept. of Electrical Engineering and Computer Science, M.I.T., PhD Thesis, 1980.

    Google Scholar 

  20. T. Leighton, C. E. Leiserson, B. Maggs, S. Plotkin and J. Wein, “Advanced Parallel and VLSI Computation,” Dept. of Electrical Engineering and Computer Science, M.I.T., MIT/LCS/RSS 2, Mar. 1988.

    Google Scholar 

  21. T. Leighton, C. E. Leiserson, B. Maggs, S. Plotkin and J. Wein, “Theory of Parallel and VLSI Computation,” Dept. of Electrical Engineering and Computer Science, M.I.T., MIT/LCS/RSS 1, Mar. 1988.

    Google Scholar 

  22. T. Leighton, “Tight Bounds on the Complexity of Parallel Sorting,” in 16th Annual ACM Symposium on Theory of Computing, pp. 71–80, 1984.

    Google Scholar 

  23. F. P. Preparata and M. I. Shamos, Computational Geometry. Springer-Verlag New York Inc., 1985.

    Google Scholar 

  24. J. Reed, A. Sangiovanni-Vincentelli and M. Santomauro, “A New Symbolic Channel Router: YACR2,” IEEE Trans. Computer-Aided Design, vol. CAD-4, no. 3, pp. 208–219, July 1985.

    Google Scholar 

  25. S. P. Reiss and J. E. Savage, “SLAP — A Methodology for Silicon Layout,” in Procs. Intl. Conf. on Circuits and Computers, pp. 281–285, 1982.

    Google Scholar 

  26. R. L. Rivest and C. M. Fiduccia, “A „Greedy” Channel Router,” in Proc. 19th IEEE Design Automation Conf., pp. 418–424, 1982.

    Google Scholar 

  27. M. Sarrafzadeh, “Channel-Routing Problem in the Knock-Knee Mode is NP-Complete,” IEEE Trans. Computer-Aided Design, vol. CAD-6, no. 4, pp. 503–506, July 1987.

    Google Scholar 

  28. J. E. Savage, “Heuristics in the SLAP Layout System,” in IEEE Intl. Conf. On Computer Design, Rye, New York, pp. 637–640, 1983.

    Google Scholar 

  29. J. E. Savage, “Three VLSI Compilation Techniques: PLA's, Weinberger Arrays, and SLAP, A New Silicon Layout Program,” in Algorithmically-Specialized Computers. Academic Press, 1983.

    Google Scholar 

  30. J. E. Savage, “Heuristics for Level Graph Embeddings,” in 9th Intl. Workshop on Graphtheoretic Concepts in Computer Science, pp. 307–318, June 1983.

    Google Scholar 

  31. T. G. Szymanski, “Dogleg Channel Routing is NP-Complete,” IEEE Trans. Computer-Aided Design, vol. CAD-4, no. 1, pp. 31–40, Jan. 1985.

    Google Scholar 

  32. M. R. Zargham, “Parallel Channel Routing,” in Proc. 25th IEEE Design Automation Conf., pp. 128–133, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brown University, Box 1910, 02912, Providence, Rhode Island

    John E. Savage & Markus G. Wloka

Authors
  1. John E. Savage
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus G. Wloka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Savage, J.E., Wloka, M.G. (1989). A parallel algorithm for channel routing. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-50728-0_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50728-4

  • Online ISBN: 978-3-540-46076-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation