Timing Analysis of Concurrent Programs

Authors Robert Mittermayr, Johann Blieberger

Thumbnail PDF


  • Filesize: 471 kB
  • 10 pages

Document Identifiers

Author Details

Robert Mittermayr
Johann Blieberger

Cite AsGet BibTex

Robert Mittermayr and Johann Blieberger. Timing Analysis of Concurrent Programs. In 12th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 23, pp. 59-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


Worst-case execution time analysis of multi-threaded software is still a challenge. This comes mainly from the fact that the number of thread interleavings grows exponentially in the number of threads and that synchronization has to be taken into account. In particular, a suitable graph based model has been missing. The idea that thread interleavings can be studied with a matrix calculus is a novel approach in this research area. Our sparse matrix representations of the program are manipulated using Kronecker algebra. The resulting graph represents the multi-threaded program and plays a similar role for concurrent systems as control flow graphs do for sequential programs. Thus a suitable graph model for timing analysis of multi-threaded software has been set up. Due to synchronization it turns out that often only very small parts of the resulting graph are actually needed, whereas the rest is unreachable. A lazy implementation of the matrix operations ensures that the unreachable parts are never calculated. This speeds up processing significantly and shows that our approach is very promising.
  • Worst-case execution time analysis (WCET)
  • Concurrency
  • Thread Synchronization
  • Kronecker Algebra
  • Program Analysis


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail