Multiprocessor schedulability analyser

Authors:
Mikel Cordovilla;Frédéric Boniol;Eric Noulard;Claire Pagetti
Affiliations:
ONERA, Toulouse, France;ONERA, Toulouse, France;ONERA, Toulouse, France;ONERA/IRIT, Toulouse, France
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 12
Cited 0

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Fairness in periodic real-time scheduling

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Cheddar: a flexible real time scheduling framework

Proceedings of the 2004 annual ACM SIGAda international conference on Ada: The engineering of correct and reliable software for real-time & distributed systems using Ada and related technologies
A generic approach to schedulability analysis of real-time tasks

Nordic Journal of Computing
An Optimal Real-Time Scheduling Algorithm for Multiprocessors

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Feasibility intervals for multiprocessor fixed-priority scheduling of arbitrary deadline periodic systems

Proceedings of the conference on Design, automation and test in Europe
Task automata: Schedulability, decidability and undecidability

Information and Computation
Schedulability Analysis of Global Fixed-Priority or EDF Multiprocessor Scheduling with Symbolic Model-Checking

ISORC '08 Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing
Formal verification of real-time systems with preemptive scheduling

Real-Time Systems
Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking

SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Within the context of hard real-time systems, the schedulability analysis of a task set is a major issue. The problem consists in proving that the tasks always satisfy their temporal constraints for a given scheduling policy and a given platform. Extensive work has been done in the last decades for defining sufficient criteria and exact algorithms. Sufficient criteria usually have an excellent complexity but often lead to an over-dimension of the system. On the opposite, exact algorithms, especially in the case of multiprocessor platform, suffer from an exponential complexity. In this paper, we study an exact technique: we apply a brute force search combined with a model checker (Uppaal) that determines whether the exploration is complete. We consider periodic tasks which execute on parallel platforms composed of homogeneous processors. Under these hypotheses, we have encoded four policies: fixed task priority, gEDF, gLLF and LLREF. The analyser is user friendly and provides promising performances.