Abstract
Performance Tracing has always been challenged by large amounts of trace data. Software tools for trace analysis and visualization successfully cope with ever growing trace sizes. Still, human perception is unable to “scale up” with the amounts of data.
With a new model of trace visualization, we try to provide less data but additional information or rather more convenient information to human users. By marking regular repetition patterns and hiding the inner details, less complex visualization can offer better insight. At the same time potentially interesting irregular sections are revealed.
The paper introduces the origin of repetition patterns and outlines the detection algorithm used. It demonstrates the new visualization scheme which has also been incorporated into Vampir NG as a prototype. Finally, it gives an outlook on further development and possible extensions.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brunst, H., Nagel, W.E., Malony, A.D.: A distributed performance analysis architecture for clusters. In: IEEE International Conference on Cluster Computing, Cluster 2003, Hong Kong, China, December 2003, pp. 73–81. IEEE Computer Society Press, Los Alamitos (2003)
Graham, S.L., Kessler, P.B., McKusick, M.K.: Gprof: A Call Graph Execution Profiler. In: SIGPLAN Symposium on Compiler Construction, Boston, Massachusetts, pp. 120–126 (1982)
Grove, D., Chambers, C.: An Assessment of Call Graph Construction Algorithms. Technical Report RC 2169, 9, IBM Research Report (March 2000), citeseer.nj.nec.com/grove00assessment.html
Grove, D., DeFouw, G., Dean, J., Chambers, C.: Call Graph Construction in Object-Oriented Languages. In: ACM Conference on Object-Oriented Programming, Atlanta, Georgia, pp. 108–124. ACM Press, New York (1997)
Knüpfer, A., Brunst, H., Nagel, W.E.: High Performance Trace Visualization. In: Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-based Processing, Lugano, Switzerland, Febuary 2005, pp. 258–263 (2005) ISBN 0-7695-2280-7
Knüpfer, A., Nagel, W.E.: Construction and Compression of Complete Call Graphs for Post-Mortem Program Trace Analysis. In: Proc. of ICPP 2005, June 14-17, 2005. Oslo/Norway (2005)
Knüpfer, A., Nagel, W.E.: New Algorithms for Performance Trace Analysis based on Compressed Complete Call Graphs. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2005. LNCS, vol. 3514, Springer, Heidelberg (2005)
Knüpfer, A., Nagel, W.E.: Compressible Memory Data Structures for Event-Based Trace Analysis. Future Generation Computer Systems 22(3), 359–368 (2006)
Nagel, W.E., Arnold, A., Weber, M., Hoppe, H.-C., Solchenbach, K.: VAMPIR: Visualization and Analysis of MPI Resources. In: Dongarra, E.S.J.J., Meuer, H.-W. (eds.) TOP500 Supercomputer Sites (November 1995)
Voigt, B.: Effiziente Erkennungs- und Visualisierungsmethoden für hierarchische Trace-Informationen. Diploma thesis (german), TU Dresden (2006)
Wolf, F., Mohr, B.: Automatic Performance Analysis of MPI Applications Based on Event Traces. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 123–132. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knüpfer, A., Voigt, B., Nagel, W.E., Mix, H. (2007). Visualization of Repetitive Patterns in Event Traces. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2006. Lecture Notes in Computer Science, vol 4699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75755-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-75755-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75754-2
Online ISBN: 978-3-540-75755-9
eBook Packages: Computer ScienceComputer Science (R0)