𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semi-online scheduling on 2 machines under a grade of

✍ Scribed by Ming Liu; Chengbin Chu; Yinfeng Xu; Feifeng Zheng

Publisher
Springer US
Year
2009
Tongue
English
Weight
333 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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-