Bounding the power of preemption in randomized scheduling

Ran Canetti*, Sandy Irani

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)993-1015
Number of pages23
JournalSIAM Journal on Computing
Volume27
Issue number4
DOIs
StatePublished - 1998
Externally publishedYes

Keywords

  • Lower bounds
  • Preemption
  • Randomized algorithms
  • Scheduling

Fingerprint

Dive into the research topics of 'Bounding the power of preemption in randomized scheduling'. Together they form a unique fingerprint.

Cite this