Advertisement

Multi-net Sizing and Spacing in General Layouts

  • Konstantin Moiseev
  • Avinoam Kolodny
  • Shmuel Wimer
Chapter

Abstract

In the previous chapters, the sizing of bundles of parallel wires has been discussed. However, bundle structures are usually formed at the higher metal layers and, even in these layers, they are only a part of the whole layout. In this chapter, general or random layout structures, their modeling and optimization, will be discussed.

Keywords

Delay Constraint Visibility Graph Wire Segment Active Vertex Wire Width 
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.

References

  1. [Boyd 06]
    S. Boyd and L. Vandenberge. Convex Optimization. Cambridge University Press, UK. 720 p., 2006.Google Scholar
  2. [Cederbaum 92]
    I. Cederbaum, I. Koren and S. Wimer, “Balanced block spacing for VLSI layout,” Discrete Applied Mathematics, Vol. 40, Issue 3, 1992, pp. 308–318.CrossRefMathSciNetGoogle Scholar
  3. [Cong 94]
    J. Cong and C. Koh, “Simultaneous Driver and Wire Sizing for Performance and Power Optimization”, IEEE Transactions on VLSI, vol. 2, no. 4, 1994Google Scholar
  4. [Cormen 05]
    T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, The MIT Press, 2005.Google Scholar
  5. [Gould 05]
    N. Gould, D. Orban and P. Toint, “Numerical methods for Large-Scale Nonlinear Optimization”, Acta Numerica, 14, pp. 299–361, 2005.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [Hanchate 06]
    N. Hanchate and N. Ranganathan, “A linear time algorithm for wire sizing with simultaneous optimization of interconnect delay and crosstalk noise”, Proceedings of the 19th International Conference on VLSI Design, pp. 283–290, 2006.Google Scholar
  7. [Kay 98]
    R. Kay and L. Pillegi, “EWA: Efficient Wiring-Sizing Algorithm for Signal Nets and Clock Nets”, IEEE Transactions on CAD of VLSI, vol. 17, no. 1, 1998Google Scholar
  8. [Liu 89]
    J. Liu, “A Graph Partitioning Algorithm by Node Separators”, ACM Transactions on Mathematical Software, vol. 15, no. 3, pp. 198–219, 1989.CrossRefzbMATHGoogle Scholar
  9. [Luksan 06]
    L. Luksan and J. Vlcek, “Efficient methods for large-scale unconstrained optimization”, Nonconvex Optimization and Its Applications, vol. 83, pp. 185–210, 2006.CrossRefMathSciNetGoogle Scholar
  10. [Moiseev 09]
    16. K. Moiseev, A. Kolodny and S. Wimer, “Power-Delay Optimization in VLSI Microprocessors by Wire Spacing,” ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 14, Issue 4 (August 2009), Article No. 55, 2009, ISSN: 1084–4309.Google Scholar
  11. [Nocedal 06]
    J. Nocedal and S. Wright, Numerical Optimization, Springer, 2006.Google Scholar
  12. [Sapatnekar 93]
    S. Sapatnekar, V. Rao, P. Vaidya and S.-M. Kang, “An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization”, IEEE Transactions on CAD of VLSI, vol. 12, no. 11, 1993.Google Scholar
  13. [Saxena 00]
    P. Saxena and C. L. Liu, “An algorithm for crosstalk-driven wire perturbation”, IEEE Transactions on CAD of Integrated Circuits and Systems, Vol. 19, No. 6, pp. 691–702, 2000CrossRefGoogle Scholar
  14. [Stellari 00]
    F. Stellari and A.L. Lacaita, “New Formulas of Interconnect Capacitances Based on Results of Conformal Mapping Method”, IEEE Transactions on Electron Devices, vol. 47, no. 1, January 2000.Google Scholar
  15. [Youssef 95]
    H. Youssef, S. M. Sait, K. J. Al-Farra, Timing influenced force directed floorplanning, Proc. of EURO-DAC, 1995, pp. 156–61Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Konstantin Moiseev
    • 1
  • Avinoam Kolodny
    • 2
  • Shmuel Wimer
    • 3
  1. 1.IntelHaifaIsrael
  2. 2.TechnionHaifaIsrael
  3. 3.Bar-Ilan UniversityRamat-GanIsrael

Personalised recommendations