𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time

✍ Scribed by George B. Mertzios; Walter Unger


Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
331 KB
Volume
3
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Online real-time preemptive scheduling o
✍ 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-