Minimizing the flow time without migration
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 198-205
- https://doi.org/10.1145/301250.301304
Abstract
We consider the classical problem of scheduling jobs in a multiprocessor settingin order to minimize the flow time (total time in the system). The performance ofthe algorithm, both in offline and online settings, can be significantly improved ifwe allow preemption: i.e., interrupt a job and later continue its execution, perhapsmigrating it to a different machine. Preemption is inherent to make a schedulingalgorithm efficient. While in case of a single processor, most operating systemscan...Keywords
This publication has 3 references indexed in Scilit:
- Approximating total flow time on parallel machinesPublished by Association for Computing Machinery (ACM) ,1997
- Approximability and nonapproximability results for minimizing total flow time on a single machinePublished by Association for Computing Machinery (ACM) ,1996
- Minimizing mean flow time with release time constraintTheoretical Computer Science, 1990