Abstract
We introduce a new approach to automatically extract an idealized logical structure from a parallel execution trace. We use this structure to define intuitive metrics such as the lateness of a process involved in a parallel execution. By analyzing and illustrating traces in terms of logical steps, we leverage a developer's understanding of the happened-before relations in a parallel program. This technique can uncover dependency chains, elucidate communication patterns, and highlight sources and propagation of delays, all of which may be obscured in a traditional trace visualization.
- D. H. Bailey et al. The nas parallel benchmarks. Int. J. Supercomput. Appl., 5(3):63--73, 1991.Google Scholar
Digital Library
- A. Knupfer, R. Brendel, H. Brunst, H. Mix, and W. E. Nagel. Introducing the open trace format (OTF). In Proc. of 6th Int. Conf. on Comp. Sci., ICCS'06, pages 526--533. Springer-Verlag, 2006. Google Scholar
Digital Library
- L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558--565, July 1978. Google Scholar
Digital Library
- W. E. Nagel, A. Arnold, M. Weber, H. C. Hoppe, and K. Solchenbach. VAMPIR: Visualization and analysis of MPI resources. Supercomputer, 12(1):69--80, 1996.Google Scholar
- TU Dresden Center for Information Services and High Performance Computing (ZIH). VampirTrace 5.14.2 user manual. http://www.tu-dresden.de/zih/vampirtrace, March 2013.Google Scholar
Index Terms
Extracting logical structure and identifying stragglers in parallel execution traces
Recommendations
Extracting logical structure and identifying stragglers in parallel execution traces
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programmingWe introduce a new approach to automatically extract an idealized logical structure from a parallel execution trace. We use this structure to define intuitive metrics such as the lateness of a process involved in a parallel execution. By analyzing and ...
Logical measure: structure of logical formula
Technologies for constructing intelligent systemsThe structure of logical and/or pseudo-logical formula is introduced. The structure of logical formula is its characteristic invariant to its functional realization ({0,1}-valued, many-valued and/or [0,1]-valued logical function). The Boolean algebra is ...
Recovering logical structure from Charm++ event traces
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and AnalysisAsynchrony and non-determinism in Charm++ programs present a significant challenge in analyzing their event traces. We present a new framework to organize event traces of parallel programs written in Charm++. Our reorganization allows one to more easily ...







Comments