Scalable timestamp synchronization for event traces of message-passing applications

Abstract

Event traces are helpful in understanding the performance behavior of message-passing applications since they allow the in-depth analysis of communication and synchronization patterns. However, the absence of synchronized clocks may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors. Although linear offset interpolation can restore consistency to some degree, time-dependent drifts and other inaccuracies may still disarrange the original succession of events – especially during longer runs. The controlled logical clock algorithm accounts for such violations in pointto-point communication by shifting message events in time as much as needed while trying to preserve the length of local intervals. In this article, we describe how the controlled logical clock is extended to collective communication to enable the correction of realistic message-passing traces. We present a parallel version of the algorithm scaling to more than thousand processes and evaluate its accuracy by showing that it eliminates inconsistent inter-process timings while preserving the length of local intervals. 2009 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.parco.2008.12.012

Extracted Key Phrases

10 Figures and Tables

Cite this paper

@article{Becker2009ScalableTS, title={Scalable timestamp synchronization for event traces of message-passing applications}, author={Daniel Becker and Rolf Rabenseifner and Felix Wolf and John C. Linford}, journal={Parallel Computing}, year={2009}, volume={35}, pages={595-607} }