On the Value of Preemption in Scheduling

DOI10.1007/11830924_6MaRDI QIDQ3595388zbMATH OpenOpenAlexFDO

Authors Gil Shallom, Yair Bartal, Stefano Leonardi, René A. Sitters

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_6

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online flow time scheduling in the presence of preemption overhead
• scientific article; zbMATH DE number 1263237
• Bounding the Power of Preemption in Randomized Scheduling
• scientific article; zbMATH DE number 2086672
• An optimal algorithm for preemptive on-line scheduling

Cited in

(10)

• How useful are preemptive schedules?
• Online and offline scheduling with cache-related preemption delays
• Online flow time scheduling in the presence of preemption overhead
• On Job Scheduling with Preemption Penalties
• Non-preemptive speed scaling
• scientific article; zbMATH DE number 1263237 (Why is no real title available?)
• scientific article; zbMATH DE number 1953323 (Why is no real title available?)
• scientific article; zbMATH DE number 2086672 (Why is no real title available?)
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• Pre-scheduling

This page was built for publication: On the Value of Preemption in Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595388)