Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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
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
Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York
ITRS—International Technology Roadmap for Semiconductors, 2009 edn. http://www.itrs.net/Links/2009ITRS/Home2009.htm
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
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
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
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)
Moore GE (1965) Cramming more components onto integrated circuits. Electronics 38(8)
Weste N, Harris D (2010) CMOS VLSI design: circuit and system perspective. Addison Wesley/Longman, Reading/Harlow
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
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moiseev, K., Kolodny, A. & Wimer, S. The complexity of VLSI power-delay optimization by interconnect resizing. J Comb Optim 23, 292–300 (2012). https://doi.org/10.1007/s10878-010-9355-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9355-1