Proceedings of the 46th Annual Design Automation Conference 2009
DOI: 10.1145/1629911.1630102
|View full text |Cite
|
Sign up to set email alerts
|

A real-time program trace compressor utilizing double move-to-front method

Abstract: This paper introduces a new unobtrusive and cost-effective method for the capture and compression of program execution traces in real-time, which is based on a double move-to-front transformation. We explore its effectiveness and describe a costeffective hardware implementation. The proposed trace compressor requires only 0.12 bits per instruction of trace port bandwidth, at the cost of 25K gates.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 8 publications
(8 reference statements)
0
10
0
Order By: Relevance
“…TABLE 5 provides more detail by showing the average trace port bandwidth for each benchmark. We compare our technique with a Nexus-like trace module (NEXS) [3] and two trace-specific adaptations of generalpurpose compression algorithms, namely the LZ scheme (TSLZ) [11] and the DMTF scheme [12], and a tracespecific compression method that uses stream cache and last stream predictor structures (rSDC-LSP) [13]. To illustrate the effectiveness of the proposed technique, we also compare it to the software gzip utility when compressing a sequence of <SL, -/BTA/ETA> pairs (SW-GZIP).…”
Section: Path Informationmentioning
confidence: 99%
See 1 more Smart Citation
“…TABLE 5 provides more detail by showing the average trace port bandwidth for each benchmark. We compare our technique with a Nexus-like trace module (NEXS) [3] and two trace-specific adaptations of generalpurpose compression algorithms, namely the LZ scheme (TSLZ) [11] and the DMTF scheme [12], and a tracespecific compression method that uses stream cache and last stream predictor structures (rSDC-LSP) [13]. To illustrate the effectiveness of the proposed technique, we also compare it to the software gzip utility when compressing a sequence of <SL, -/BTA/ETA> pairs (SW-GZIP).…”
Section: Path Informationmentioning
confidence: 99%
“…However, the proposed module has a relatively high complexity (50,000 gates). Uzelac and Milenković introduced a double move-to-front method that requires 0.12 bits per instruction on the trace port on average at an estimated cost of 24,600 logic gates [12]. A compressor using a stream descriptor cache and predictor structures requires a slightly higher trace port bandwidth (0.15 bits per instruction) but has a much lower hardware complexity [13].…”
Section: Introductionmentioning
confidence: 99%
“…Some of these techniques rely on hardware implementations of general-purpose compressors, such as LZ [8] or double-move-to-front [9]. Although they significantly reduce the size of the trace that needs to be streamed out, they have a relatively high complexity (50,000 gates and 24,600 gates, respectively).…”
Section: Introductionmentioning
confidence: 99%
“…Several proposals address reduction of trace messages captured on SOCs buses, but they provide fairly limited compression ratios [11]. Whereas several academic proposals have addressed real-time hardware-based compression of program execution traces [12][13][14], the more challenging problem of realtime hardware-based reduction of data address and value traces has not been directly addressed so far.…”
Section: Introductionmentioning
confidence: 99%