𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On lazy bureaucrat scheduling with common deadlines

✍ Scribed by Ling Gai; Guochuan Zhang


Publisher
Springer US
Year
2007
Tongue
English
Weight
264 KB
Volume
15
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On Nonpreemptive LCFS Scheduling with De
✍ U. Schmid; J. Blieberger πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 947 KB

We investigate some real time behaviour of a (discrete time) single server system with nonpreemptive LCFS task scheduling. The main results deal with the probability distribution of a random variable \(\operatorname{SRD}(T)\), which describes the time the system operates without any violation of a f

On-line scheduling with tight deadlines
✍ Chiu-Yuen Koo; Tak-Wah Lam; Tsuen-Wan Ngan; Kunihiko Sadakane; Kar-Keung To πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 136 KB
Batch scheduling with deadlines on paral
✍ Mikhail Y. Kovalyov; Yakov M. Shafransky πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 529 KB

The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. ( 1997) and Kovalyov and Shafransky ( 1994). A classification of computational complexities of special cases was provided only for the situation when all groups

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-