𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preemptive scheduling of independent jobs with release times and deadlines on a hypercube

✍ Scribed by Jürgen Plehn

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
376 KB
Volume
34
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive scheduling with release times
Preemptive scheduling with release times and deadlines
✍ Kwang Soo Hong; Joseph Y-T. Leung 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 905 KB

We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms ex

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-