On the value of preemption in scheduling

Y. Bartal, S. Leonardi, G. Shallom, R.A. Sitters

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    12 Citations (Scopus)

    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.
    Original languageEnglish
    Title of host publicationApproximation, 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
    EditorsJ. Diaz, K. Jansen, J.D.P. Rolim, U. Zwick
    Place of PublicationBerlin
    PublisherSpringer
    Pages39-48
    ISBN (Print)3-540-38044-2
    DOIs
    Publication statusPublished - 2006

    Publication series

    NameLecture Notes in Computer Science
    Volume4110
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'On the value of preemption in scheduling'. Together they form a unique fingerprint.

    Cite this