Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FGCS
2006

favoriteEmaildiscussreport

125views more FGCS 2006»

Compressible memory data structures for event-based trace analysis

13 years 4 months ago

Compressible memory data structures for event-based trace analysis

Download tu-dresden.de

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 significantly. Furthermore, customized evaluation algorithms reduce the computational effort. The data structure as well as algorithms for construction and evaluation are discussed in detail. Experiments with real-life traces demonstrate the theoretically derived capabilities of the new approach. Key words: Performance Analysis, Tracing, Data Structures, Compression

Andreas Knüpfer, Wolfgang E. Nagel

Real-time Traffic

Compressible Memory Data | Data Structures | FGCS 2006 | Huge Traces |

claim paper

Related Content

» Performance Analysis of a New Packet Trace Compressor based on TCP Flow Clustering

» Address Trace Compression Through Loop Detection and Reduction

» Path Grammar Guided Trace Compression and Trace Approximation

» Large program trace analysis and compression with ZDDs

» HMTT a platform independent fullsystem memory trace monitoring system

» Prediction and trace compression of data access addresses through nested loop recognition

» Interactive Visualization for Memory Reference Traces

» Towards anomaly comprehension using structural compression to navigate profiling calltrees

» Compact Fast and Robust Grids for Ray Tracing

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FGCS
Authors	Andreas Knüpfer, Wolfgang E. Nagel

Comments (0)