Address trace compression through loop detection and reduction
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 27 (1) , 214-215
- https://doi.org/10.1145/301453.301577
Abstract
This paper introduces a new technique for compressing memory address traces. The technique relies on the simple observation that most programs spend their time executing loops, and therefore the trace will follow the structures of such loops. We adapt classic control flow analysis to detect the loops within an address trace, then analyze them to identify constant and loopvarying memory references. These references are efficiently encoded to reduce the size of the trace, often resulting in an order of magnitude reduction in size compared to the most compact trace format known to date.Keywords
This publication has 9 references indexed in Scilit:
- PDATS Lossless Address Trace Compression For Reducing File Size And Access TimePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Trace-driven memory simulationACM Computing Surveys, 1997
- An analysis of the information content of address and data reference streamsPublished by Association for Computing Machinery (ACM) ,1993
- Efficient program tracingComputer, 1993
- Abstract execution: A technique for efficiently tracing programsSoftware: Practice and Experience, 1990
- Blocking: exploiting spatial locality for trace compactionPublished by Association for Computing Machinery (ACM) ,1990
- Techniques for efficient inline tracing on a shared-memory multiprocessorPublished by Association for Computing Machinery (ACM) ,1990
- Mache: no-loss trace compactionPublished by Association for Computing Machinery (ACM) ,1989
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977