Toward Static Timing Analysis of Parallel Software

Authors Andreas Gustavsson, Jan Gustafsson, Björn Lisper



PDF
Thumbnail PDF

File

OASIcs.WCET.2012.38.pdf
  • Filesize: 0.55 MB
  • 10 pages

Document Identifiers

Author Details

Andreas Gustavsson
Jan Gustafsson
Björn Lisper

Cite As Get BibTex

Andreas Gustavsson, Jan Gustafsson, and Björn Lisper. Toward Static Timing Analysis of Parallel Software. In 12th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 23, pp. 38-47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/OASIcs.WCET.2012.38

Abstract

The current trend within computer, and even real-time, systems is to incorporate parallel hardware, e.g., multicore processors, and parallel software. Thus, the ability to safely analyse such parallel systems, e.g., regarding the timing behaviour, becomes necessary. Static timing analysis is an approach to mathematically derive safe bounds on the execution time of a program, when executed on a given hardware platform. This paper presents an algorithm that statically analyses the timing of parallel software, with threads communicating through shared memory, using abstract interpretation. It also gives an extensive example to clarify how the algorithm works.

Subject Classification

Keywords
  • Parallelism
  • BCET
  • WCET
  • Static analysis
  • Abstract interpretation

Metrics

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

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail