New Algorithms for Performance Trace Analysis based on Compressed Complete Call Graphs

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review

Abstract

This paper addresses performance and scalability issues of state-of-the-art trace analysis. The Complete Call Graph (CCG) data structure is proposed as an alternative to the common linear storage schemes. By transparent in-memory compression CCGs are capable of exploiting redundancy as frequently found in traces and thus reduce the memory requirements notably. Evaluation algorithms can be designed to take advantage of CCGs, too, such that the computational effort is reduced in the same order of magnitude as the memory requirements.

Details

Original languageEnglish
Title of host publicationComputational Science - ICCS 2005
EditorsVS Sunderam, GD VanAlbada, PMA Sloot, JJ Dongarra
PublisherSpringer, Berlin [u. a.]
Pages116-123
Number of pages8
Volume2
EditionNeuerscheinung
ISBN (print)3-540-26043-9
Publication statusPublished - 2005
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 3514
ISSN0302-9743

Conference

TitleInternational Conference on Computational Science 2005
SubtitleAdvancing Science through Computation
Abbreviated titleICCS 2005
Conference number5
Duration22 - 25 May 2005
LocationEmory University
CityAtlanta
CountryUnited States of America

External IDs

WOS 000230023800015
Scopus 25144501126

Keywords

Library keywords