Zeitschriftenartikel:
R. Mittermayr, J. Blieberger:
"Deadlock and WCET Analysis of Barrier-Synchronized Concurrent Programs";
Computing,
103
(2021),
5;
S. 749
- 770.
Kurzfassung englisch:
Kronecker algebra until now has been applied to concurrent programs that use semaphores and protected objects for synchronization. Like many other programming languages, Ada uses barriers, too. In this paper, we present a new synchronization construct for barriers. By applying this, we are able to statically analyze Ada multi-tasking programs that employ barriers for synchronization issues. It turns out that we can use our existing Kronecker algebra implementation completely unmodified for concurrent program graphs using such barrier synchronization primitives. In addition, we extend a static WCET technique such that our barrier synchronization primitive is supported.
Schlagworte:
Barrier synchronization, Worst-case execution time analysis, Deadlocks, Kronecker algebra, Concurrent systems, Multi-threaded programs
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/s00607-017-0555-8
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.