Data Compression Transformations for Dynamically Allocated Data Structures (2002)
| Venue: | Data Structures,” International Conference on Compiler Construction |
| Citations: | 38 - 8 self |
BibTeX
@INPROCEEDINGS{Zhang02datacompression,
author = {Youtao Zhang and Rajiv Gupta},
title = {Data Compression Transformations for Dynamically Allocated Data Structures},
booktitle = {Data Structures,” International Conference on Compiler Construction},
year = {2002},
pages = {14--28},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a class of transformations which modify the representation of dynamic data structures used in programs with the objective of compressing their sizes. We have developed the common prefix and narrow-data transformations that respectively compress a 32 bit address pointer and a 32 bit integer field into 15 bit entities. A pair of fields which have been compressed by the above compression transformations are packed together into a single 32 bit word. The above transformations are designed to apply to data structures that are partially compressible, that is, they compress portions of data structures to which transformations apply and provide a mechanism to handle the data that is not compressible. The accesses to compressed data are efficiently implemented by designing data compression extensions (DCX) to the processor's instruction set. We have observed average reductions in heap allocated storage of 25% and average reductions in execution time and power consumption of 30%. If DCX support is not provided the reductions in execution times fall from 30% to 12.5%.
