loading...
Hardw are Implementation of Data Compression Algorithms for Memory Energy Optimization
Tampa, Florida February 20-February 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2003.1183487IEEE Computer Society Annual Symposiu ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Luca Benini, Universit? di Bologna
Davide Bruni, Universit? di Bologna
Alberto Macii, Politecnico di Torino
Enrico Macii, Politecnico di Torino
This paper describes implementation details of a hardware compression and decompression unit (CDU) for optimizing energy consumption in processor-based systems. Many algorithms for data compression (i.e., profile-driven, adaptive, differential) have been introduced in [1, 2]. In all cases, data compression and decompression are performed on-the-fly on the cache-to-memory path: Uncompressed cache lines are compressed before they are written back to main memory, and decompressed when cache refills occur. This paper completes and extends the contributions of [1, 2] by providing evidence on the feasibility of the proposed compression architectures by specifically addressing hardware implementation issues. CDU design is targeted towards energy minimization in the cache- bus-memory subsystem with a strict constraint on performance. As a result, average memory energy reductions evaluated on several benchmark programs are around 24%, at no performance penalty.
Citation:
Luca Benini, Davide Bruni, Alberto Macii, Enrico Macii, "Hardw are Implementation of Data Compression Algorithms for Memory Energy Optimization," isvlsi, pp.250, IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.