License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2012.59
URN: urn:nbn:de:0030-drops-35570
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3557/
Go to the corresponding OASIcs Volume Portal

Mittermayr, Robert ; Blieberger, Johann

Timing Analysis of Concurrent Programs

pdf-format:
p059-mittermayr.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{mittermayr_et_al:OASIcs:2012:3557,
  author =	{Robert Mittermayr and Johann Blieberger},
  title =	{{Timing Analysis of Concurrent Programs}},
  booktitle =	{12th International Workshop on Worst-Case Execution Time Analysis},
  pages =	{59--68},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-41-5},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{23},
  editor =	{Tullio Vardanega},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3557},
  URN =		{urn:nbn:de:0030-drops-35570},
  doi =		{10.4230/OASIcs.WCET.2012.59},
  annote =	{Keywords: Worst-case execution time analysis (WCET), Concurrency, Thread Synchronization, Kronecker Algebra, Program Analysis}
}

Keywords: Worst-case execution time analysis (WCET), Concurrency, Thread Synchronization, Kronecker Algebra, Program Analysis
Collection: 12th International Workshop on Worst-Case Execution Time Analysis
Issue Date: 2012
Date of publication: 10.07.2012

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI