Compressible memory data structures for event-based trace analysis

Research output: Contribution to journalConference articleContributedpeer-review

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 languageEnglish
Pages (from-to)359-368
Number of pages10
JournalFuture Generation Computer Systems
Volume22
Issue number3
Publication statusPublished - Feb 2006
Peer-reviewedYes

Conference

TitleInternational Conference on Computational Science 2003
Abbreviated titleICCS 2003
Conference number3
Duration2 - 4 June 2003
CityMelbourne
CountryAustralia

External IDs

WOS 000234493900012
Scopus 28044454955

Keywords

Keywords

  • performance analysis, tracing data structures, compression