2026-07-23T15:27:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3557 2024-03-06T10:29:01Z ddc:004 open_access

Timing Analysis of Concurrent Programs Mittermayr, Robert Blieberger, Johann Worst-case execution time analysis (WCET) Concurrency Thread Synchronization Kronecker Algebra Program Analysis 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Robert Mittermayr and Johann Blieberger 2012 Is Part Of OASIcs, Volume 23, 12th International Workshop on Worst-Case Execution Time Analysis (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2012.59 urn:nbn:de:0030-drops-35570 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2012.59 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode