Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e ≈2.718.
KeywordsVirtual Machine Competitive Ratio Online Algorithm Identical Machine Online Schedule
Unable to display preview. Download preview PDF.
- 1.Albers, S.: On randomized online scheduling. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 134–143. ACM Press, New York (2002)Google Scholar
- 11.Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical J. 45, 1563–1581 (1966)Google Scholar
- 13.Rudin III, J.F.: Improved Bound for the Online Scheduling Problem. PhD thesis, The University of Texas at Dallas (2001)Google Scholar