MPI Trace Compression Using Event Flow Graphs
2014 (English)Conference paper (Refereed)
Understanding how parallel applications behave is crucial for using high-performance computing (HPC) resources efficiently. However, the task of performance analysis is becoming increasingly difficult due to the growing complexity of scientific codes and the size of machines. Even though many tools have been developed over the past years to help in this task, current approaches either only offer an overview of the application discarding temporal information, or they generate huge trace files that are often difficult to handle.
In this paper we propose the use of event flow graphs for monitoring MPI applications, a new and different approach that balances the low overhead of profiling tools with the abundance of information available from tracers. Event flow graphs are captured with very low overhead, require orders of magnitude less storage than standard trace files, and can still recover the full sequence of events in the application. We test this new approach with the NERSC-8/Trinity Benchmark suite and achieve compression ratios up to 119x.
Place, publisher, year, edition, pages
2014. 1-12 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8632
MPI event flow graphs, trace compression, trace reconstruction, performance monitoring
Research subject Computer Science
IdentifiersURN: urn:nbn:se:kth:diva-165042DOI: 10.1007/978-3-319-09873-9-1ScopusID: 2-s2.0-84958532986OAI: oai:DiVA.org:kth-165042DiVA: diva2:806807
Euro-Par 2014 Parallel Processing
QC 20150423. QC 201603142015-04-212015-04-212016-03-14Bibliographically approved