✦ LIBER ✦

Real-Time Schedulability Tests for Preemptive Multitasking

✍ Scribed by C. J. Fidge

Book ID: 110257223
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 174 KB
Volume: 14
Category: Article
ISSN: 0922-6443
DOI: 10.1023/a:1007993819750

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deterministic preemptive scheduling of r

Deterministic preemptive scheduling of real-time tasks

✍ Jackson, L.E.; Rouskas, G.N. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 260 KB

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

Non-Preemptive Real-Time Scheduling of M

Non-Preemptive Real-Time Scheduling of Multimedia Tasks

✍ Shlomi Dolev; Alexander Keizelman 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 124 KB

Genealogy of hard real-time preemptive s

Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

✍ Müller, Dirk ;Werner, Matthias 📂 Article 📅 2011 🏛 De Gruyter Open Sp. z o.o. 🌐 English ⚖ 277 KB

A note on preemptive scheduling of perio

A note on preemptive scheduling of periodic, real-time tasks

✍ Joseph Y.-T. Leung; M.L. Merrill 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Online real-time preemptive scheduling o

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

✍ Bhaskar Das Gupta; Michael A. Palis 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-