## Abstract

We consider the problem of scheduling jobs arriving over time in a multiprocessor setting, with immediate dispatching, disallowing job migration. The goal is to minimize both the total flow time (total time in the system) and the total completion time. Previous studies have shown that while preemption (interrupt a job and later continue its execution) is inherent to make a scheduling algorithm efficient, migration (continue the execution on a different machine) is not. Still, the current non-migratory online algorithms suffer from a need for a central queue of unassigned jobs which is a "no option" in large computing system, such as the Web. We introduce a simple online non-migratory algorithm IMD, which employs immediate dispatching, i.e., it immediately assigns released jobs to one of the machines. We show that the performance of this algorithm is within a logarithmic factor of the optimal migratory offline algorithm, with respect to the total flow time, and within a small constant factor of the optimal migratory offline algorithm, with respect to the total completion time. This solves an open problem suggested by Awerbuch et al [STOC99].

Original language | English |
---|---|

Pages | 11-18 |

Number of pages | 8 |

DOIs | |

State | Published - 2003 |

Event | Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - San Diego, SA, United States Duration: 7 Jun 2003 → 9 Jun 2003 |

### Conference

Conference | Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures |
---|---|

Country/Territory | United States |

City | San Diego, SA |

Period | 7/06/03 → 9/06/03 |

## Keywords

- Competitive
- Completion time
- Flow time
- On-line