It is well known that on-line preemptive scheduling algorithms can achieve efficient performance. A classic example is the Shortest Remaining Processing Time (SRPT) algorithm which is optimal for flow time scheduling, assuming preemption is costless. In real systems, however, preemption has significant overhead. In this paper we suggest a new model where preemption is costly. This introduces new considerations for preemptive scheduling algorithms and inherently calls for new scheduling strategies. We present a simple on-line algorithm and present lower bounds for on-line as well as efficient off-line algorithms which show that our algorithm performs close to optimal.
|Title of host publication||Approximation, randomization, and combinatorial optimization algorithms and techniques : 9th International Workshop on Approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th International Workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006 : proceedings|
|Editors||J. Diaz, K. Jansen, J.D.P. Rolim, U. Zwick|
|Place of Publication||Berlin|
|Publication status||Published - 2006|
|Name||Lecture Notes in Computer Science|