TY - JOUR
T1 - Bounding the power of preemption in randomized scheduling
AU - Canetti, Ran
AU - Irani, Sandy
PY - 1998
Y1 - 1998
N2 - We study on-line scheduling in overloaded systems. Requests for jobs arrive one by one as time proceeds; the serving agents have limited capacity and not all requests can be served. Still, we want to serve the "best" set of requests according to some criterion. In this situation, the ability to preempt (i.e., abort) jobs in service in order to make room for better jobs that would otherwise be rejected has proven to be of great help in some scenarios. We show that, surprisingly, in many other scenarios this is not the case. In a simple, generic model, we prove a polylogarithmic lower bound on the competitiveness of randomized and preemptive on-line scheduling algorithms. Our bound applies to several recently studied problems. In fact, in certain scenarios our bound is quite close to the competitiveness achieved by known deterministic, nonpreemptive algorithms.
AB - We study on-line scheduling in overloaded systems. Requests for jobs arrive one by one as time proceeds; the serving agents have limited capacity and not all requests can be served. Still, we want to serve the "best" set of requests according to some criterion. In this situation, the ability to preempt (i.e., abort) jobs in service in order to make room for better jobs that would otherwise be rejected has proven to be of great help in some scenarios. We show that, surprisingly, in many other scenarios this is not the case. In a simple, generic model, we prove a polylogarithmic lower bound on the competitiveness of randomized and preemptive on-line scheduling algorithms. Our bound applies to several recently studied problems. In fact, in certain scenarios our bound is quite close to the competitiveness achieved by known deterministic, nonpreemptive algorithms.
KW - Lower bounds
KW - Preemption
KW - Randomized algorithms
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=0012328903&partnerID=8YFLogxK
U2 - 10.1137/S0097539795283292
DO - 10.1137/S0097539795283292
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0012328903
SN - 0097-5397
VL - 27
SP - 993
EP - 1015
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 4
ER -