In computer system buses, most of the energy is spent to change the voltage of each line from high to low or vice versa. Bus encoding schemes aim to improve energy efficiency by reducing the average number of transitions between successive uses of the bus. We derive in closed form the performance of optimal and suboptimal low-weight line codes designed for this purpose, and propose new algorithms for their implementation. We then show that some low-complexity suboptimal schemes have a small performance loss with respect to the optimal ones. For example, by adding 8 lines to a 128 lines bus, we save 20.7% of energy with the optimal scheme and 19.4% with suitable suboptimal schemes.
翻译:在计算机大客车中,大部分能源用于改变每条电线的电压,从高到低,反之亦然。 公共汽车编码计划旨在通过减少连续使用公共汽车之间的平均转换次数来提高能源效率。 我们以封闭形式获得为此目的设计的最佳和低于最佳的低重量线码,并提出新的执行算法。 然后我们表明,一些低复杂性亚最佳计划在最佳计划方面有少量性能损失。 例如,在128条电线大客车中增加了8条线,我们用最佳计划节省了20.7%的能源,用适当的次最佳计划节省了19.4%。</s>