Abstract
Parallel event trace visualizations can aid in discovery of the root causes of certain performance problems on high-end systems. However, traditional trace visualizations are not inherently scalable and require considerable effort on the part of the user to identify similarities and differences in performance across parallel entities. In this work, we evaluate several methods for deciding when traces of different processes in a run are similar enough that only one of the traces needs to be retained and rendered in the visualization. We show visualizations of reduced traces and evaluate them for compression, error, and retention of correct diagnostic information. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Mohror, K., Karavanic, K. L., & Snavely, A. (2010). Scalable event trace visualization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6043 LNCS, pp. 228–237). https://doi.org/10.1007/978-3-642-14122-5_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.