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 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
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
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-