On the value of preemption in scheduling

Authors:
Yair Bartal;Stefano Leonardi;Gil Shallom;Rene Sitters
Affiliations:
Department of Computer Science, Hebrew University, Jerusalem, Israel;Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, Rome, Italy;Department of Computer Science, Hebrew University, Jerusalem, Israel;Max-Planck-Insitut für Informatik, Saarbrücken, Germany
Venue:
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Year:
2006

Citing 10
Cited 5

Measurement-based characterization of global memory and network contention, operating system and parallelization overheads

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Performance degradation due to multiprogramming and system overheads in real workloads: case study on a shared memory multiprocessor

ICS '90 Proceedings of the 4th international conference on Supercomputing
Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Preemptive Weighted Completion Time Scheduling of Parallel Jobs

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Parallel Processor Scheduling with Limited Number of Preemptions

SIAM Journal on Computing
Effects of clock resolution on the scheduling of interactive and soft real-time processes

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Online Scheduling to Minimize Average Stretch

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

On burst transmission scheduling in mobile TV broadcast networks

IEEE/ACM Transactions on Networking (TON)
Broadcasting video streams encoded with arbitrary bit rates in energy-constrained mobile TV networks

IEEE/ACM Transactions on Networking (TON)
Non-preemptive speed scaling

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
SIGACT news online algorithms column 21: APPROX and ALGO

ACM SIGACT News
Non-preemptive speed scaling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.