๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximating the Throughput of Multiple Machines in Real-Time Scheduling

โœ Scribed by Bar-Noy, Amotz; Guha, Sudipto; Naor, Joseph (Seffi); Schieber, Baruch

Book ID
118180476
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
226 KB
Volume
31
Category
Article
ISSN
0097-5397

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-