✦ LIBER ✦

On scheduling tasks with exponential service times and in-tree precedence constraints

✍ Scribed by John Bruno

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 463 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264227

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal scheduling of unit-time tasks on

Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints

✍ W. Kubiak 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 621 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