Online Scheduling to Minimize Average Stretch

  title={Online Scheduling to Minimize Average Stretch},
  author={S. Muthukrishnan and Rajmohan Rajaraman and Anthony Shaheen and Johannes Gehrke},
We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by thestretch of the job, which is defined as the ratio of the amount of time that the job spends in the system to the processing time of the job. For a given sequence of jobs, we measure the performance of an algorithm by theaverage stretchachieved by the algorithm over all the jobs in the sequence. The average… CONTINUE READING
Highly Cited
This paper has 117 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 75 extracted citations

Online Scheduling

Algorithms for Optimization with Incomplete Information • 2004
View 8 Excerpts
Highly Influenced

Algorithms for Flow Time Scheduling

View 6 Excerpts
Highly Influenced

A New On-line Method for Scheduling Independent Tasks

2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID) • 2017
View 1 Excerpt

118 Citations

Citations per Year
Semantic Scholar estimates that this publication has 118 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 13 references

Schedul - ing data transfers in a network and the set scheduling prob

M. Henzinger A. Goel, S. Plotkin
Proceedings of the 31 st Annual ACM Symposium on Theory of Computing • 1999

The case for SRPT scheduling in web servers

M. Harchol-Balter, M. Crovella, S. Park
Technical Report MIT–LCS–TR–767, Laboratory for Computer Science, Massachussets Institute of Technology, October • 1998
View 3 Excerpts

On-line Scheduling | a Survey

Ji R Sgall
View 1 Excerpt

Similar Papers

Loading similar papers…