Advertisement

Channel Routing in the Knock-Knee Diagonal Model

  • Xiaoyu Song

Abstract

We consider the channel routing problem for multiterminal nets in the knock-knee diagonal model (KKD), where the grid consists of right and left tracks displayed at +45° and −45°. We present a powerful channel structure and give three results on channel routing in KKD by a unified and simple algorithm. Let P be a channel routing problem of density d.
  1. (a)

    [11] If all nets of P are two-terminal nets then d+1 is an upper bound to w (solved optimally).

     
  2. (b)

    If all nets of P are two- or three-terminal nets, then \( \left\lfloor {\frac{{3d}} {2}} \right\rfloor \) is an upper bound to w.

     
  3. (c)

    2d is always an upper bound to w in KKD.

     

Keywords

Current Column Diagonal Model Vertical Width Point Sand Layout Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B.S. Baker, S.N. Bhatt, and F.T. Leighton, “An approximation algorithm for Manhattan routing,” Proc. 15th Ann. ACM Symp. on Theory of Computing, pp. 477-486, 1983.Google Scholar
  2. [2]
    M. Brady, and D.J. Brown, “VLSI routing: four layers suffice,” Advances in Computing Research (F.P. Preparata, ed.), vol.2, JAI Press, Greenwich, CT, 1984, pp. 245–257.Google Scholar
  3. [3]
    E. Lodi, “Routing Multiterminal Nets in a Diagonal Model,” Proc. Conf. Information Science and Systems, Princeton, pp. 899-902, 1988.Google Scholar
  4. [4]
    E. Lodi, F. Luccio and L. Pagli, “A Preliminary Study of a Diagonal Channel Routing Model,” Algorithmica, vol. 4, pp. 585–597, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    E. Lodi, F. Luccio and L. Pagli, “A 4d Channel Router for A Two Layer Diagonal Model,” Proc. A.W.O.C.88, Corfu, Greece 1988. In LNCS 319, Springer Verlag, New York 1988.Google Scholar
  6. [6]
    E. Lodi, F. Luccio and L. Pagli, “A Good Channel Router for A Diagonal Model,” Technical Report, TR-14/89, Dipartimento di Informatica, University of Pisa, April 1989.Google Scholar
  7. [7]
    E. Lodi, F. Luccio, and L. Pagli, “Channel Routing for Strictly Multiterminal Nets,” Technical Report, TR-38/89, Università di Pisa, Dipartimento di Informatica (December 1989). Integration, the VLSI Journal Vol.8, No.2, 143–153, 1989.CrossRefGoogle Scholar
  8. [8]
    E. Lodi, F. Luccio and X.Y. Song, “A 2d Channel Router for the Diagonal Model,” Technical Report, TR-38/89, Dipartimento di Informatica, University of Pisa, December 1989. Integration, the VLSI Journal, volume 11(2), 111–125, 1991.CrossRefGoogle Scholar
  9. [9]
    K. Mehlhorn, F.P. Preparata, and M. Sarrafzadeh, “Channel Routing in Knock-knee Mode: Simplified Algorithms and Proofs,” Algorithmica, vol. 1, pp. 213–221, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    M. Sarrafzadeh, and F.P. Preparata, “Compact Channel Routing of Multiterminal Nets,” Annals of Discrete Mathematics 25 (1985) 255–280.MathSciNetGoogle Scholar
  11. [11]
    X.Y. Song, “An Optimum Channel Routing Algorithm in the Knock-Knee Diagonal Model. Technical Report, TR-16/90, Università di Pisa, Dipartimento di Informatica (July, 1990).Google Scholar
  12. [12]
    Song, X.Y. An Algorithm for L-shaped Channel Routing in A Diagonal Model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 11, 267-270.Google Scholar
  13. [13]
    Song, X.Y. VLSI Routing Algorithms in Diagonal Models. Ph.D. Thesis: TD-4/91. Università di Pisa, Dipartimento di Informatica, 1991.Google Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Xiaoyu Song
    • 1
  1. 1.Dept. I.R.O.Université de MontréalMontréalCanada

Personalised recommendations