A parallel trace-data interface for scalable performance analysis

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Automatic trace analysis is an effective method of identifying complex performance phenomena in parallel applications. To simplify the development of complex trace-analysis algorithms, the EARL library interface offers high-level access to individual events contained in a global trace file. However, as the size of parallel systems grows further and the number of processors used by individual applications is continuously raised, the traditional approach of analyzing a single global trace file becomes increasingly constrained by the large number of events. To enable scalable trace analysis, we present a new design of the aforementioned EARL interface that accesses multiple local trace files in parallel while offering means to conveniently exchange events between processes. This article describes the modified view of the trace data as well as related programming abstractions provided by the new PEARL library interface and discusses its application in performance analysis. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Geimer, M., Wolf, F., Knüpfer, A., Mohr, B., & Wylie, B. J. N. (2007). A parallel trace-data interface for scalable performance analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 398–408). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free