Compressing Extended Program Traces Using Value Predictors

Trace files record the execution behavior of programs for future analysis. Unfortunately, nontrivial program traces tend to be very large and have to be compressed. While good compression schemes exist for traces that capture only the PCs of the executed instructions, these schemes can be ineffectiv...

Full description

Saved in:
Bibliographic Details
Main Authors: Burtscher, Martin, Jeeradit, Metha
Format: Conference Proceeding
Language:English
Subjects:
Information systems > Data management systems > Data structures > Data layout > Data compression
Software and its engineering > Software creation and management > Software verification and validation > Process validation > Traceability
Software and its engineering > Software notations and tools > Compilers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Trace files record the execution behavior of programs for future analysis. Unfortunately, nontrivial program traces tend to be very large and have to be compressed. While good compression schemes exist for traces that capture only the PCs of the executed instructions, these schemes can be ineffective on extended traces that include important additional information such as register values or effective addresses. Our novel, value-prediction-basedapproach compresses extended traces up to 22.8 times better and about two and a half times as well on average. In addition to the higher compression rate, our lossless single-pass algorithm has a fixed memory requirement and compresses traces faster than other algorithms. It achieves compression rates of up to 6170. This paper describes the design of our compression method and illustrates how value predictors can be used to effectively compress extended program traces.
DOI:10.5555/942806.943860