The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Energy-aware lossless data compression
Open accessAbstract
Wireless transmission of a single bit can require over 1000 times more energy than a single computation. It can therefore be beneficial to perform additional 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 an increase in battery life for portable computers. This article presents a study of the energy savings possible by losslessly compressing data prior to transmission. A variety of algorithms were measured on a StrongARM SA-110 processor. This work demonstrates that, with several typical compression algorithms, there is a actually a net energy increase when compression is applied before transmission. Reasons for this increase are explained and suggestions are made to avoid it. One such energy-aware suggestion is asymmetric compression , the use of one compression algorithm on the transmit side and a different algorithm for the receive path. By choosing the lowest-energy compressor and decompressor on the test platform, overall energy to send and receive data can be reduced by 11% compared with a well-chosen symmetric pair, or up to 57% over the default symmetric zlib scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
The SimpleScalar tool set, version 2.0
Burger, D., & Austin, T. M. (1997) · ACM SIGARCH Computer Architecture News · doi:10.1145/268806.268810 · Cited by 3,048
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
Introduction to Data Compression
(2018) · Elsevier eBooks · doi:10.1016/c2015-0-06248-7 · Cited by 2,129
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
A low-bandwidth network file system
Muthitacharoen, A., Chen, B., & Mazières, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502052 · Cited by 784
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (2014) · 25th Anniversary International Conference on Supercomputing Anniversary Volume - · doi:10.1145/2591635.2667174 · Cited by 453
PowerScope: a tool for profiling the energy usage of mobile applications
Flinn, J., & Satyanarayanan, M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749272 · Cited by 433
Compressing TCP/IP Headers for Low-Speed Serial Links
Jacobson, V. (1990) · doi:10.17487/rfc1144 · Cited by 427
Proceedings - Design Automation Conference
Nookala, V., & Sapatnekar, S. S. (2004) · ACM/IEEE Design Automation Conference (DAC) · Cited by 405
Proceedings of the International Symposium On Circuits And Systems
Erdogan, A. T., Arslan, T., & Horrocks, D. H. (1997) · Cited by 393
Lelewer, D. A., & Hirschberg, D. S. (1987) · ACM Computing Surveys · doi:10.1145/45072.45074 · Cited by 377
JouleTrack: a web based tool for software energy profiling
Sinha, A., & Chandrakasan, A. P. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.378467 · Cited by 364
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
Critical power slope: understanding the runtime effects of frequency scaling
Miyoshi, A., Lefurgy, C., Van Hensbergen, E., Rajamony, R., & Rajkumar, R. (2002) · Proceedings of the 16th international conference on Supercomputing · doi:10.1145/514191.514200 · Cited by 231
[1991] Proceedings. Data Compression Conference
(1991) · doi:10.1109/dcc.1991 · Cited by 180
Shkarin, D. (2003) · Proceedings DCC 2002. Data Compression Conference · doi:10.1109/dcc.2002.999958 · Cited by 167
(2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498501 · Cited by 152
Proceedings of the 48th Design Automation Conference
Stok, L., Dutt, N., & Hassoun, S. (2011) · doi:10.1145/2024724 · Cited by 103
Algorithmic transforms for efficient energy scalable computation
Sinha, A., Wang, A., & Chandrakasan, A. P. (2000) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1109/lpe.2000.155249 · Cited by 58
A fast hardware data compression algorithm and some algorithmic extensions
Craft, D. J. (1998) · IBM Journal of Research and Development · doi:10.1147/rd.426.0733 · Cited by 47
Longest‐match string searching for ziv‐lempel compression
Bell, T., & Kulp, D. (1993) · Software Practice and Experience · doi:10.1002/spe.4380230705 · Cited by 31
A VLSI systolic array architecture for Lempel-Ziv-based data compression
Jung, B., & Burleson, W. P. (2002) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.1994.409103 · Cited by 12
Cited by
Machine learning in wireless sensor networks: Algorithms, strategies, and applications
Alsheikh, M. A., Lin, S., Niyato, D., & Tan, H.-P. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320099 · Cited by 965
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sadler, C. M., & Martonosi, M. (2006) · Proceedings of the 4th international conference on Embedded networked sensor systems · doi:10.1145/1182807.1182834 · Cited by 418
A Wearable, Multimodal Sensing System to Monitor Knee Joint Health
Teague, C. N., Heller, J. A., Nevius, B. N., Carek, A. M., Mabrouk, S., Garcia-Vicente, F., Inan, O. T., & Etemadi, M. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.2994552 · Cited by 66
Metadata
- Authors
- Barr, K. C., & Asanović, K.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2006-08
- Volume
- 24
- Issue
- 3
- Pages
- 250-291
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W1964369900
- Cited by
- 346
- References
- 28
- FWCI
- 16.87
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.