Skip to main content
Springer Nature Link
Log in

Optimal multilayer channel routing with overlap

  • Published:
Algorithmica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper presents algorithms for multiterminal net channel routing where multiple interconnect layers are available. Major improvements are possible if wires are able to overlap, and our generalized main algorithm allows overlap, but only on everyKth (K ≥ 2) layer. Our algorithm will, for a problem with densityd onL layers,L ≥K + 3,provably use at most three tracks more than optimal: ⌈(d + 1)/⌈L/K⌉⌉ + 2 tracks, compared with the lower bound of ⌈d/⌈L/K⌉⌉. Our algorithm is simple, has few vias, tends to minimize wire length, and could be used if different layers have different grid sizes. Finally, we extend our algorithm in order to obtain improved results for adjacent (K = 1) overlap: ⌈(d + 2)/⌊2L/3⌋⌉ + 5 forL ≥ 7.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berger, B., M. Brady, D. J. Brown, and T. Leighton, Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing,Journal of the Association for Computing Machinery, to appear.

  2. Bolognesi, T., and D. J. Brown, A Channel Routing Algorithm with Bounded Wire Length, unpublished manuscript, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign (1982).

  3. Brady, M., and D. J. Brown, VLSI Routing: Four Layers Suffice,Advances in Computing Research, Vol. 2, ed. F. P. Preparata, JAI Press, Greenwich, CT, pp. 245–257 (1984).

    Google Scholar 

  4. Brady, M., and D. J. Brown, An Algorithm for Three Layer Channel Routing Using Unrestricted Overlap,Proc. 23rd Allerton Conf. on Communication, Control, and Computing, pp. 674–675 (Oct. 1985).

  5. Brady, M., and D. J. Brown, Optimal Multilayer Channel Routing with Overlap,Proc. 4th MIT Conf. on Advanced Research in VLSI, pp. 281–296 (Apr. 1985).

  6. Brown, D. J., A 7/4d Algorithm for Two Layer Routing with Overlap, draft (1983).

  7. Chen, Y. K., and M. L. Liu, Three Layer Channel Routing,IEEE Trans, on Computer-Aided Design of Integrated Circuits and Systems,3 (2), 156–163 (Apr, 1984).

    Article  Google Scholar 

  8. Deutsch, D. N., A Dogleg Channel Router,Proc. 13th Design Automation Conf., pp. 425–433 (June 1976).

  9. Gao, S., An Algorithm for Two-Layer Channel Routing,Proc. 2nd Annual Symp. on Theoretical Aspects in Computer Science, pp. 151–160 (1985).

  10. Gao, S., and S. Hambrusch, Two-Layer Channel Routing with Vertical Unit-Length Overlap,Algorithmica,1 (2), 223–232 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  11. Gao, S., and M. Kaufmann, Channel Routing of Multiterminal Nets,Proc. 28thIEEE Symp. on Foundations of Computer Science, pp. 316–325 (Oct. 1987). (Submitted toJournal of the Association for Computing Machinery.)

  12. Hambrusch, S., Using Overlap and Minimizing Contact Points in Channel Routing,Proc. 21stAllerton Conf. on Communication, Control, and Computing, pp. 256–257 (Oct. 1983).

  13. Hambrusch, S., Channel Routing Algorithms for Overlap Models,IEEE Trans, on Computer-Aided Design of Integrated Circuits and Systems,4 (1), 23–30 (Jan. 1985).

    Article  Google Scholar 

  14. Leighton, F. T., New Lower Bounds for Channel Routing, MIT VLSI Memo 82-71 (Jan. 1982). (Submitted toSIAM Journal on Discrete Mathematics).

  15. Preparata, F. P., and W. Lipski, Jr., Optimal Three-Layer Channel Routing,IEEE Trans, on Computers,33, 427–437 (May 1984).

    Article  MATH  Google Scholar 

  16. Rivest, R. L., A. Baratz, and G. Miller, Provably Good Channel Routing Algorithms,Proc. 1981 CMU Conf. on VLSI Systems and Computations, pp. 153–159 (Oct. 1981).

  17. Rivest, R. L., and C. M. Fiduccia, A Greedy Channel Router,Proc. 19th Design Automation Conf., pp. 418–424 (June 1982).

  18. Rosenberg, A., Three Dimensional VLSI: A Case Study,Journal of the Association for Computing Machinery,30 (3), 397–416 (July 1983).

    MATH  MathSciNet  Google Scholar 

  19. Sarrafzadeh, M., and F. P. Preparata, Compact Channel Routing of Multiterminal Nets,Annals of Discrete Mathematics,25, 255–280 (1985).

    MathSciNet  Google Scholar 

  20. Yoshimura, T., and E. S. Kuh, Efficient Algorithms for Channel Routing,IEEE Trans, on Computer-Aided Design of Integrated Circuits and Systems,1 (1), 25–35 (Jan. 1982).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lockheed R&DD, 0-9740/B202, 3251 Hanover Street, 94304, Palo Alto, CA, USA

    Martin L. Brady

  2. Coordinated Science Laboratory, University of Illinois, 61801, Urbana, IL, USA

    Donna J. Brown

Authors
  1. Martin L. Brady
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Donna J. Brown
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Communicated by A. S. La Paugh.

This work was supported by the Semiconductor Research Corporation under Contract 83-01-035, by a grant from the General Electric Corporation, and by a grant at the University of the Saarland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brady, M.L., Brown, D.J. Optimal multilayer channel routing with overlap. Algorithmica 6, 83–101 (1991). https://doi.org/10.1007/BF01759036

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words