Skip to main content
SpringerLink
Log in

A 4d channel router for a two layer diagonal model

  • Late Paper
  • Conference paper
  • First Online:
Book cover VLSI Algorithms and Architectures (AWOC 1988)

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

Included in the following conference series:

Abstract

We consider a variation of the channel routing model called diagonal model (DM), where the connections are laid in two layers, along tracks at +45° (first layer) and −45° (second layer). Based on some theoretical results, we present an algorithm that solves any two-terminal routing problem in DM, in a channel of width 4d. No similar result is known in the Manhattan model, where the best algorithm completely analyzed attains a channel width of d+O(f), f≤ √n.

This work has been supported in part by Ministero della Pubblica Istruzione of Italy.

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. Hu T.C., Kuh E.S. Theory and Concepts of Circuits Layout. In T.C. Hu and K.S. Kuh, Eds.: VLSI Circuit Layout: Theory and Design, IEEE Press Selected Rep. Series, New York 1985.

    Google Scholar 

  2. Leighton T. A Survey of Problems and Results for Channel Routing, A.W.O.C., Loutraki, Greece, July 1986.

    Google Scholar 

  3. Preparata F.P., Lipski W. Optimal Three-layer Wireable Layouts, IEEE Trans. on Comp. C-33 (1984), 427–437.

    Google Scholar 

  4. Sarrafzadeh M. Hierarchical Approaches to VLSI Circuit Layout, Coordinated Science Lab., Univ. of Illinois, Tech. Rep. ACT 72, 1986.

    Google Scholar 

  5. Brown D. and Rivest R. L. New Lower Bounds on Channel Width, Proc. CMU Conference on VLSI Systems and Computations, Computer Science Press 1981, 178–185.

    Google Scholar 

  6. Lodi E., Luccio F. and Pagli L. A preliminary study of a Diagonal Channel Routing Model, Algorithmica, to appear.

    Google Scholar 

  7. Baker B.S., Bhatt S.N., Leighton T. An Approximation Algorithm for Manhattan Routing, in F.P.Preparata, Ed., Advances in Computing Research, Vol.2, JAI Press 1984.

    Google Scholar 

  8. Rivest R.L., Baratz A.E. and Miller G. Provably good channel routing algorithms, Proc. CMU Conference on VLSI Systems and computations, 1981.

    Google Scholar 

  9. Lodi E., Luccio F. and Pagli L. Channel Routing in the Diagonal Model, Dipartimento di Informatica, Univ. of Pisa, Int. Rep. 1988.

    Google Scholar 

  10. Lodi E. Routing Multiterminal Nets in a Diagonal Model, Proc. 22nd CISS, Princeton 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italy

    E. Lodi & F. Luccio

  2. Dipartimento di Informatica e Applicazioni, Università di Salerno, Italy

    L. Pagli

Authors
  1. E. Lodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lodi, E., Luccio, F., Pagli, L. (1988). A 4d channel router for a two layer diagonal model. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040413

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation