### Abstract

We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimize the flow time (total time in the system). The performance of the algorithm, both in offline and online settings, can be significantly improved if we allow preemption: i.e., interrupt a job and later continue its execution, perhaps migrating it to a different machine. Preemption is inherent to make a scheduling algorithm efficient. While in case of a single processor, most operating systems can easily handle preemptions, migrating a job to a different machine results in a huge overhead. Thus, it is not commonly used in most multiprocessor operating systems. The natural question is whether migration is an inherent component for an efficient scheduling algorithm, in either online or offline setting. Leonardi and Raz (STOC'97) showed that the well known algorithm, shortest remaining processing time (SRPT), performs within a logarithmic factor of the optimal algorithm. Note that SRPT must use both preemption and migration to schedule the jobs. It is not known if better approximation factors can be reached. In fact, in the on-line setting, Leonardi and Raz showed that no algorithm can achieve a better bound. Without migration, no (offline or online) approximations are known. This paper introduces a new algorithm that does not use migration, works online, and is just as effective (in terms of approximation ratio) as the best known offline algorithm (SRPT) that uses migration.

Original language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Publisher | ACM |

Pages | 198-205 |

Number of pages | 8 |

State | Published - 1999 |

Event | Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA Duration: May 1 1999 → May 4 1999 |

### Other

Other | Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 |
---|---|

City | Atlanta, GA, USA |

Period | 5/1/99 → 5/4/99 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. 198-205). ACM.

**Minimizing the flow time without migration.** / Awerbuch, Baruch; Azar, Yossi; Leonardi, Stefano; Regev, Oded.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*ACM, pp. 198-205, Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99, Atlanta, GA, USA, 5/1/99.

}

TY - CHAP

T1 - Minimizing the flow time without migration

AU - Awerbuch, Baruch

AU - Azar, Yossi

AU - Leonardi, Stefano

AU - Regev, Oded

PY - 1999

Y1 - 1999

N2 - We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimize the flow time (total time in the system). The performance of the algorithm, both in offline and online settings, can be significantly improved if we allow preemption: i.e., interrupt a job and later continue its execution, perhaps migrating it to a different machine. Preemption is inherent to make a scheduling algorithm efficient. While in case of a single processor, most operating systems can easily handle preemptions, migrating a job to a different machine results in a huge overhead. Thus, it is not commonly used in most multiprocessor operating systems. The natural question is whether migration is an inherent component for an efficient scheduling algorithm, in either online or offline setting. Leonardi and Raz (STOC'97) showed that the well known algorithm, shortest remaining processing time (SRPT), performs within a logarithmic factor of the optimal algorithm. Note that SRPT must use both preemption and migration to schedule the jobs. It is not known if better approximation factors can be reached. In fact, in the on-line setting, Leonardi and Raz showed that no algorithm can achieve a better bound. Without migration, no (offline or online) approximations are known. This paper introduces a new algorithm that does not use migration, works online, and is just as effective (in terms of approximation ratio) as the best known offline algorithm (SRPT) that uses migration.

AB - We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimize the flow time (total time in the system). The performance of the algorithm, both in offline and online settings, can be significantly improved if we allow preemption: i.e., interrupt a job and later continue its execution, perhaps migrating it to a different machine. Preemption is inherent to make a scheduling algorithm efficient. While in case of a single processor, most operating systems can easily handle preemptions, migrating a job to a different machine results in a huge overhead. Thus, it is not commonly used in most multiprocessor operating systems. The natural question is whether migration is an inherent component for an efficient scheduling algorithm, in either online or offline setting. Leonardi and Raz (STOC'97) showed that the well known algorithm, shortest remaining processing time (SRPT), performs within a logarithmic factor of the optimal algorithm. Note that SRPT must use both preemption and migration to schedule the jobs. It is not known if better approximation factors can be reached. In fact, in the on-line setting, Leonardi and Raz showed that no algorithm can achieve a better bound. Without migration, no (offline or online) approximations are known. This paper introduces a new algorithm that does not use migration, works online, and is just as effective (in terms of approximation ratio) as the best known offline algorithm (SRPT) that uses migration.

UR - http://www.scopus.com/inward/record.url?scp=0032650477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032650477&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032650477

SP - 198

EP - 205

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM

ER -