% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Becker:6608,
      author       = {Becker, D. and Rabenseifner, R. and Wolf, F. and Linford,
                      J.},
      title        = {{S}calable timestamp synchronization for event traces of
                      message-passing applications},
      journal      = {Parallel computing},
      volume       = {35},
      issn         = {0167-8191},
      address      = {Amsterdam [u.a.]},
      publisher    = {North-Holland, Elsevier Science},
      reportid     = {PreJuSER-6608},
      pages        = {595 - 607},
      year         = {2009},
      note         = {Record converted from VDB: 12.11.2012},
      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
                      point-to-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. (C) 2009 Elsevier B.V. All rights
                      reserved.},
      keywords     = {J (WoSType)},
      cin          = {JSC / JARA-HPC},
      ddc          = {004},
      cid          = {I:(DE-Juel1)JSC-20090406 / $I:(DE-82)080012_20140620$},
      pnm          = {Scientific Computing / ATMLPP - ATML Parallel Performance
                      (ATMLPP)},
      pid          = {G:(DE-Juel1)FUEK411 / G:(DE-Juel-1)ATMLPP},
      shelfmark    = {Computer Science, Theory $\&$ Methods},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000272962600004},
      doi          = {10.1016/j.parco.2008.12.012},
      url          = {https://juser.fz-juelich.de/record/6608},
}