Preemptive Scheduling on Selfish Machines

DOI10.1007/978-3-540-77294-1_7MaRDI QIDQ5458506zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

Publication date 15 April 2008

Published in Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77294-1_7

Mathematics Subject Classification ID

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

Recommendations

• On truthfulness and approximation for scheduling selfish tasks
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Truthful approximation mechanisms for scheduling selfish related machines
• STACS 2005
• A unified approach to truthful scheduling on related machines

Cites work

• A Level Algorithm for Preemptive Scheduling
• Algorithms – ESA 2005
• Frugality in path auctions
• scientific article; zbMATH DE number 2079341 (Why is no real title available?)
• scientific article; zbMATH DE number 2119764 (Why is no real title available?)
• Minimizing makespan and preemption costs on a system of uniform machines
• Optimal preemptive scheduling for general target functions
• Preemptive Scheduling of Uniform Processor Systems
• STACS 2004
• STACS 2004
• STACS 2005
• Truth revelation in approximately efficient combinatorial auctions
• Truthful approximation mechanisms for restricted combinatorial auctions

Cited in

(5)

• Coordination mechanisms for selfish scheduling
• Scheduling selfish jobs on multidimensional parallel machines
• Scheduling with bully selfish jobs
• Preemptive scheduling on a small number of hierarchical machines
• Jackson's semi-preemptive scheduling on a single machine

This page was built for publication: Preemptive Scheduling on Selfish Machines

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