Data Compression Transformations for Dynamically Allocated Data Structures

  • Youtao Zhang
  • Rajiv Gupta
Conference paper

DOI: 10.1007/3-540-45937-5_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2304)
Cite this paper as:
Zhang Y., Gupta R. (2002) Data Compression Transformations for Dynamically Allocated Data Structures. In: Horspool R.N. (eds) Compiler Construction. CC 2002. Lecture Notes in Computer Science, vol 2304. Springer, Berlin, Heidelberg

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 commonpre 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 packedt ogether 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 implementedb y designing data compression extensions (DCX) to the processor’s instruction set. We have observeda verage reductions in heap allocatedst orage of 25% and average reductions in execution time andp ower consumption of 30%. If DCX support is not provided the reductions in execution times fall from 30% to 12.5%.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Youtao Zhang
    • 1
  • Rajiv Gupta
    • 1
  1. 1.Dept. of Computer ScienceThe University of ArizonaArizona

Personalised recommendations