✦ LIBER ✦

Fixed-priority scheduling of real-time systems using utilization bounds

✍ Scribed by Dong-Won Park; Swaminathan Natarajan; Arkady Kanevsky

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 812 KB
Volume: 33
Category: Article
ISSN: 0164-1212
DOI: 10.1016/0164-1212(95)00105-0

No coin nor oath required. For personal study only.

📜 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

Techniques to increase the schedulable u

Techniques to increase the schedulable utilization of cache-based preemptive real-time systems

✍ José V. Busquets-Mataix; Daniel Gil; Pedro Gil; Andy Wellings 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 624 KB

162 Specification of real-time job sched

162 Specification of real-time job scheduling systems using timed statecharts: A. Sowmya, pp 733–738

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Bounds for nonpreemptive scheduling of j

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm

✍ H. Kellerer 📂 Article 📅 1991 🏛 Springer Vienna 🌐 English ⚖ 365 KB