Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios

Authors:
Leah Epstein
Affiliations:
-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 10
Cited 0

A lower bound for randomized on-line scheduling algorithms

Information Processing Letters
New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
Randomized online scheduling on two uniform machines

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
A lower bound for on-line scheduling on uniformly related machines

Operations Research Letters
Preemptive on-line scheduling for two uniform processors

Operations Research Letters
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are nondecreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.