Deadlock and WCET analysis of barrier-synchronized concurrent programs

DOI10.1007/S00607-017-0555-8zbMath1473.68050OpenAlexW2612081101MaRDI QIDQ2030166

Johann Blieberger, Robert Mittermayr

Publication date: 7 June 2021

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-017-0555-8

zbMATH Keywords

concurrent systemsdeadlocksmulti-threaded programsKronecker algebrabarrier synchronizationworst-case execution time analysis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Data-flow frameworks for worst-case execution time analysis
• Efficient computation and representation of large reachability sets for composed automata
• Timing analysis of concurrent programs running on shared cache multi-cores
• On automation in the verification of software barriers: experience report
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Deadlock and WCET analysis of barrier-synchronized concurrent programs