Using Dynamic Tracing Sampling to Measure Long Running Programs

  • Authors:
  • Jeffrey Odom;Jeffrey K. Hollingsworth;Luiz DeRose;Kattamuri Ekanadham;Simone Sbaraglia

  • Affiliations:
  • University of Maryland;University of Maryland;Cray Inc, Mendota Heights, MN;IBM T. J. Watson Research Center, NY;IBM T. J. Watson Research Center, NY

  • Venue:
  • SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Detailed cache simulation can be useful to both system developers and application writers to understand an application's performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application's execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors.