𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal schedulability interval for real-time systems of periodic tasks with offsets

✍ Scribed by Annie Choquet-Geniet; Emmanuel Grolleau

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
286 KB
Volume
310
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot deal with them. Our aim is to extend and improve the well-known cyclicity result of Leung and Merill to every scheduling algorithm and to systems of interacting tasks with o sets. One of the main beneÿt of our result is to enable the use of o -line scheduling methods for those real-time critical systems.

📜 SIMILAR VOLUMES

Fixed priority scheduling of tasks with
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
✍ Romulo Silva de Oliveira; Joni da Silva Fraga 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 219 KB

This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have ®xed priorities and hard end-to-end deadlines that are equal to or less