Cooling Codes: Thermal-Management Coding for High-Performance Interconnects
Preprint
Abstract
High temperatures have dramatic negative effects on interconnect performance and, hence, numerous techniques have been proposed to reduce the power consumption of on-chip buses. However, existing methods fall short of fully addressing the thermal challenges posed by high-performance interconnects. In this paper, we introduce new efficient coding schemes that make it possible to directly control the peak temperature of a bus by effectively cooling its hottest wires. This is achieved by avoiding state transitions on the hottest wires for as long as necessary until their temperature drops off. We also reduce the average power consumption by making sure that the total number of state transitions on all the wires is below a prescribed threshold. We show how each of these two features can be coded for separately or, alternatively, how both can be achieved at the same time. In addition, error-correction for the transmitted information can be provided while controlling the peak temperature and/or the average power consumption. In general, our cooling codes use $n > k$ wires to encode a given $k$-bit bus. One of our goals herein is to determine the minimum possible number of wires $n$ needed to encode $k$ bits while satisfying any combination of the three desired properties. We provide full theoretical analysis in each case. In particular, we show that $n = k+t+1$ suffices to cool the $t$ hottest wires, and this is the best possible. Moreover, although the proposed coding schemes make use of sophisticated tools from combinatorics, discrete geometry, linear algebra, and coding theory, the resulting encoders and decoders are fully practical. They do not require significant computational overhead and can be implemented without sacrificing a large circuit area.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Improved upper bounds for partial spreadsDesigns, Codes and Cryptography, 2016
- Lectures on Advances in Combinatorics2008
- On-chip bus thermal analysis and optimisationIET Computers & Digital Techniques, 2007
- Codes and Anticodes in the Grassman GraphJournal of Combinatorial Theory, Series A, 2002
- Quorum Systems Constructed from Combinatorial DesignsInformation and Computation, 2001
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- A new table of constant weight codesIEEE Transactions on Information Theory, 1990
- The existence of resolvable Steiner quadruple systemsJournal of Combinatorial Theory, Series A, 1987
- Intersection theorems for systems of finite setsActa Mathematica Hungarica, 1964
- The Transient Response of Damped Linear Networks with Particular Regard to Wideband AmplifiersJournal of Applied Physics, 1948