Researchers have proposed approaches to verify that real-time multiprocessor systems meet their timeliness constraints. These approaches make assumptions on the model of computation, the load placed on the multiprocessor system, and the faults that can arise. This heterogeneous set of assumptions make these approaches hard to compare.
This tutorial will present an overview and positioning of four recently proposed approaches. We present for each approach, the application domain in which its assumptions are realistic and the dominant application requirements that have driven its development. Next to discussing timeliness guarantees, we give attention to the robustness aspects of each approach; e.g. against faults such as overload.
|Conference||Eighth IEEE/ACM/IFIP International Conference on Hardware/software Codesign and System synthesis, CODES/ISSS 2010, Scottsdale, Arizona, USA|
|Period||24/10/10 → …|