@inproceedings{7d986e0190ee4a51ad36eb57aa74347f,
title = "On the value of preemption in scheduling",
abstract = "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.",
author = "Yair Bartal and Stefano Leonardi and Gil Shallom and Rene Sitters",
year = "2006",
doi = "10.1007/11830924_6",
language = "אנגלית",
isbn = "3540380442",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "39--48",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a",
address = "גרמניה",
note = "9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006 ; Conference date: 28-08-2006 Through 30-08-2006",
}