✦ LIBER ✦

802.5 priority mechanism in hard real-time RMS applications

✍ Scribed by J Santos; ML Gastaminza; J Orozco; C Matrangolo

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 394 KB
Volume: 17
Category: Article
ISSN: 0140-3664
DOI: 10.1016/0140-3664(94)90128-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive LCFS scheduling in hard real-

Preemptive LCFS scheduling in hard real-time applications

✍ J Blieberger; U Schmid 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 783 KB

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