Energy aware lossless data compression

被引:45
作者
Barr, K [1 ]
Asanovic, K [1 ]
机构
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
来源
PROCEEDINGS OF MOBISYS 2003 | 2003年
关键词
D O I
10.1145/1066116.1066123
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to reduce the number of bits transmitted. If the energy required to compress data is less than the energy required to send it, there is a net energy savings and consequently, a longer battery life for portable computers. This paper reports on the energy of lossless data compressors as measured on a StrongARM SA-110 system. We show that with several typical compression tools, there is a net energy increase when compression is applied before transmission. Reasons for this increase are explained, and hardware-aware programming optimizations are demonstrated. When applied to Unix compress, these optimizations improve energy efficiency by 51%. We also explore the fact that, for many usage models, compression and decompression need not be performed by the same algorithm. By choosing the lowest-energy compressor and decompressor on the test platform, rather than using default levels of compression, overall energy to send compressible web data can be reduced 31%. Energy to send harder-to-compress English text can be reduced 57%. Compared with a system using a single optimized application for both compression and decompression, the asymmetric scheme saves 11% or 12% of the total energy depending on the dataset.
引用
收藏
页码:231 / 244
页数:14
相关论文
共 46 条
  • [11] GILCHRIST J, ARCH COMP TEST
  • [12] HAVINGA PJ, 1999, IEEE WIR COMM NETW C
  • [13] HICKS J, 1999, COMPAQ PERSONAL SERV
  • [14] Housel B.C., 1996, P 2 ANN INT C MOB CO
  • [15] HUNT JJ, 1996, SOFTWARE CONFIGURATI
  • [16] *INT CORP, 2001, INT STRONGARM SA 111
  • [17] *INT CORP, 2000, SA 110 MICR TECHN RE
  • [18] Jamieson K., 2002, THESIS MIT
  • [19] JANNESEN P, NCOMPRESS AVAILABLE
  • [20] KOSKELIN K, 2002, 2 ANN STUD OX WORKSH