Address trace compression through loop detection and reduction

Elmootazbellah Elnozahy*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

18 Scopus citations

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 loop-varying 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.

Original languageEnglish (US)
Pages (from-to)214-215
Number of pages2
JournalPerformance Evaluation Review
Volume27
Issue number1
DOIs
StatePublished - Jan 1 1999
EventProceedings of the 1999 International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS '99 - Atlata, GA, USA
Duration: May 1 1999May 4 1999

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Address trace compression through loop detection and reduction'. Together they form a unique fingerprint.

Cite this