Journal of Combinatorial Optimization

, Volume 23, Issue 2, pp 292–300 | Cite as

The complexity of VLSI power-delay optimization by interconnect resizing

  • Konstantin Moiseev
  • Avinoam Kolodny
  • Shmuel Wimer


The lithography used for 32 nanometers and smaller VLSI process technologies restricts the interconnect widths and spaces to a very small set of admissible values. Until recently the sizes of interconnects were allowed to change continuously and the implied power-delay optimal tradeoff could be formulated as a convex programming problem, for which classical search algorithms are applicable. Once the admissible geometries become discrete, continuous search techniques are inappropriate and new combinatorial optimization solutions are in order. A first step towards such solutions is to study the complexity of the problem, which this paper is aiming at. Though dynamic programming has been shown lately to solve the problem, we show that it is NP-complete. Two typical VLSI design scenarios are considered. The first trades off power and sum of delays (L 1), and is shown to be NP-complete by reduction of PARTITION. The second considers power and max delays (L ), and is shown to be NP-complete by reduction of SUBSET_SUM.


Power-delay optimization VLSI interconnects NP-completeness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Boese KD, Kahng AB, McCoy BA, Robins G (1993) Fidelity and near optimality of Elmore-based routing constructions. Digest of technical papers, ICCAD, pp 81–84 Google Scholar
  2. Cong J, He L, Koh CK, Pan Z (2001) Interconnect sizing and spacing with consideration of coupling capacitance. IEEE Trans Comput Aided Des Integr Circuits Syst 20(9):1164–1169 CrossRefGoogle Scholar
  3. Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York MATHGoogle Scholar
  4. ITRS—International Technology Roadmap for Semiconductors, 2009 edn.
  5. Li W-N, Lim A, Agrawal P, Sahani S (1993) On the circuit implementation problem. IEEE Trans Comput Aided Des Integr Circuits Syst 12(8):1147–1156 CrossRefGoogle Scholar
  6. Magen N, Kolodny A, Weiser U, Shamir N (2004) Interconnect power dissipation in a microprocessor. In: International workshop on system-level interconnect prediction, pp 7–13 Google Scholar
  7. Moiseev K, Wimer S, Kolodny A (2009) Power-delay optimization in vlsi microprocessors by wire spacing. ACM Trans Des Automat Electron Syst 14(4):55 Google Scholar
  8. Moiseev K, Kolodny A, Wimer S (2010) Interconnect bundle sizing under discrete design rules. IEEE Trans Comput Aided Des Integr Circuits Syst 29(10) (to appear) Google Scholar
  9. Moore GE (1965) Cramming more components onto integrated circuits. Electronics 38(8) Google Scholar
  10. Weste N, Harris D (2010) CMOS VLSI design: circuit and system perspective. Addison Wesley/Longman, Reading/Harlow Google Scholar
  11. Wimer S, Michaely S, Moiseev K, Kolodny A (2006) Optimal bus sizing in migration of processor design. IEEE Trans Circuits Syst-I 53(5):1089–1100 CrossRefGoogle Scholar
  12. Zuber P, Bahlous O, Ilnesher T, Ritter M, Stechele W (2009) Wire topology optimization for low power CMOS. IEEE Trans VLSI Syst 17(1):1–11 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Konstantin Moiseev
    • 1
  • Avinoam Kolodny
    • 1
  • Shmuel Wimer
    • 2
  1. 1.EE Dept.Technion, Israel Institute of TechnologyHaifaIsrael
  2. 2.Eng. SchoolBar-Ilan UniversityRamat-GanIsrael

Personalised recommendations