Article ID: | iaor20081240 |
Country: | United Kingdom |
Volume: | 9 |
Issue: | 4 |
Start Page Number: | 365 |
End Page Number: | 379 |
Publication Date: | Aug 2006 |
Journal: | Journal of Scheduling |
Authors: | Schieber Baruch, Kimbrel Tracy, Sviridenko Maxim |
Suppose that we are given n persistent tasks (jobs) that need to be executed in an equitable way on m processors (machines). Each machine is capable of performing one unit of work in each integral time unit and each job may be executed on at most one machine at a time. The schedule needs to specify which job is to be executed on each machine in each time window. The goal is to find a schedule that minimizes job migrations between machines while guaranteeing a fair schedule. We measure the fairness by the drift d defined as the maximum difference between the execution times accumulated by any two jobs. As jobs are persistent we measure the quality of the schedule by the ratio of the number of migrations to time windows. We show a tradeoff between the drift and the number of migrations. Let