Minimizing the Flow Time Without Migration

@article{Awerbuch2002MinimizingTF,
  title={Minimizing the Flow Time Without Migration},
  author={Baruch Awerbuch and Yossi Azar and Stefano Leonardi and Oded Regev},
  journal={SIAM J. Comput.},
  year={2002},
  volume={31},
  pages={1370-1382}
}
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 the case of a single processor most operating systems… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 57 CITATIONS, ESTIMATED 97% COVERAGE

Make-to-Order Integrated Scheduling and Distribution

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Average stretch without migration

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Scheduling to minimize average stretch without migration

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Online Scheduling

  • Algorithms for Optimization with Incomplete Information
  • 2004
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Algorithms for flow time scheduling

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2000
2019

CITATION STATISTICS

  • 8 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Approximating total ow time on parallel machines

D. Raz.
  • InProceedings of the Twenty - Ninth Annual ACM Symposium on Theory of Computing
  • 1997

Approximating total ow time on parallel machines

D. Raz.
  • InProceedings of the Twenty - Ninth Annual ACM Symposium on Theory of Computing
  • 1997

Approximation algorithms for scheduling

L. A. Hall.
  • 1997

Sequencing andscheduling : algorithms and complexity

A. H. G. Rinnooy Kan, D. B. Shmoys.
  • Handbooks in operations research andmanagement science
  • 1993

Sequencing andscheduling : algorithms and complexity

A. H. G. Rinnooy Kan, D. B. Shmoys.
  • Handbooks in operations research andmanagement science
  • 1993

Minimizing mean ow time with releasetime constraint

J. Y. T. Leung J. Du, G. H. Young
  • Theoretical Computer Science
  • 1974

Pruhs . Eliminating Migration in MultiProcessorScheduling

K.
  • Journal of Algorithms