| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 425444 | Future Generation Computer Systems | 2006 | 10 Pages |
Abstract
The paper 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andreas Knüpfer, Wolfgang E. Nagel,