Semi-clairvoyant scheduling

DOI10.1016/J.TCS.2004.05.023MaRDI QIDQ1887092zbMATH OpenOpenAlexFDO

Authors Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs

Publication date 23 November 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.05.023

zbMATH Keywords

SchedulingAverage flow timeSemi-clairvoyanceSimultaneous competitiveness

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Semi-clairvoyant scheduling
• scientific article; zbMATH DE number 437567
• Speed is more powerful than clairvoyance
• Nonclairvoyant scheduling
• scientific article; zbMATH DE number 1383710

Cites work

• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• scientific article; zbMATH DE number 1383710 (Why is no real title available?)
• scientific article; zbMATH DE number 2119737 (Why is no real title available?)
• A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
• Minimizing flow time nonclairvoyantly
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• Nonclairvoyant scheduling
• Online Scheduling to Minimize Average Stretch
• Scheduling in the dark
• Speed is as powerful as clairvoyance

Cited in

(5)

• Energy-efficient multiprocessor scheduling for flow time and makespan
• SEH: size estimate hedging for single-server queues
• Semi-clairvoyant scheduling
• SEH: size estimate hedging scheduling of queues
• Pre-scheduling

This page was built for publication: Semi-clairvoyant scheduling

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