Compressible memory data structures for event-based trace analysis
Research output: Contribution to journal › Conference article › Contributed › peer-review
Contributors
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. (c) 2004 Elsevier B.V. All rights reserved.
Details
Original language | English |
---|---|
Pages (from-to) | 359-368 |
Number of pages | 10 |
Journal | Future Generation Computer Systems |
Volume | 22 |
Issue number | 3 |
Publication status | Published - Feb 2006 |
Peer-reviewed | Yes |
Conference
Title | International Conference on Computational Science 2003 |
---|---|
Abbreviated title | ICCS 2003 |
Conference number | 3 |
Duration | 2 - 4 June 2003 |
City | Melbourne |
Country | Australia |
External IDs
WOS | 000234493900012 |
---|---|
Scopus | 28044454955 |
Keywords
Keywords
- performance analysis, tracing data structures, compression