On the competitiveness of on-line real-time task scheduling
β Scribed by S. Baruah; G. Koren; D. Mao; B. Mishra; A. Raghunathan; L. Rosier; D. Shasha; F. Wang
- Publisher
- Springer US
- Year
- 1992
- Tongue
- English
- Weight
- 999 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0922-6443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Mes
within a small constant factor of log D (i.e., they are provably near-optimal) if r < 1/Klog DL; and (4) we introduce a novel admission control policy that partitions the server bandwidth based on the expected popularities of different request lengths and experimentally demonstrate its benefits comp