𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Online scheduling with a buffer on related machines

✍ Scribed by György Dósa; Leah Epstein

Publisher
Springer US
Year
2008
Tongue
English
Weight
468 KB
Volume
20
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online deadline scheduling on faster mac
Online deadline scheduling on faster machines
✍ Jae-Hoon Kim; Kyung-Yong Chwa 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Online deadline scheduling is to determine which jobs are accepted or rejected, where jobs have the deadline by which they must finish their processing and they arrive in the online fashion. The slack of a job is the gap between its arrival time and the last time when it can first be scheduled to me

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-