By Topic

On using Aksum for semi-automatically searching of performance problems in parallel and distributed programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Seragiotto, C. ; Inst. for Software Sci., Univ. of Vienna, Austria ; Fahringer, T. ; Geissler, M. ; Madsen, G.
more authors

There has been an increasing research interest in formalizing and automating the search for performance problems. In previous work we have introduced Aksum, which tries to automatically locate all performance problems in parallel and distributed applications based on multi-experiment performance analysis and user-provided machine and problem sizes. In this paper we report on experiences with Aksum for performance analysis of three realistic message passing, shared memory and mixed parallelism codes taken from laser physics, material science, and financial modeling. Aksum has been used to automatically decide which code regions must be instrumented, what performance information must be collected, and to launch experiments and test performance hypotheses as soon as more performance data becomes available. Multiple-experiment performance analysis enables the user to compare the performance behavior across a range of problem and machine sizes.

Published in:

Parallel, Distributed and Network-Based Processing, 2003. Proceedings. Eleventh Euromicro Conference on

Date of Conference:

5-7 Feb. 2003