Sciweavers

26 search results - page 1 / 6
» Compressible memory data structures for event-based trace an...
Sort
View
FGCS
2006
125views more  FGCS 2006»
13 years 4 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
ISPASS
2005
IEEE
13 years 10 months ago
Performance Analysis of a New Packet Trace Compressor based on TCP Flow Clustering
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...
Raimir Holanda, Javier Verdú, Jorge Garc&ia...
SIGMETRICS
1999
ACM
130views Hardware» more  SIGMETRICS 1999»
13 years 9 months ago
Address Trace Compression Through Loop Detection and Reduction
ded 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 execut...
E. N. Elnozahy
HPDC
2006
IEEE
13 years 11 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
CGO
2010
IEEE
13 years 11 months ago
Large program trace analysis and compression with ZDDs
Prior work has shown that reduced, ordered, binary decision diagrams (BDDs) can be a powerful tool for program trace analysis and visualization. Unfortunately, it can take hours o...
Graham D. Price, Manish Vachharajani