Preemptive Scheduling on Selfish Machines

DOI10.1007/978-3-540-77294-1_7zbMath1136.68351OpenAlexW1499120818MaRDI QIDQ5458506

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing makespan and preemption costs on a system of uniform machines
• Truthful approximation mechanisms for restricted combinatorial auctions
• Optimal preemptive scheduling for general target functions
• Truth revelation in approximately efficient combinatorial auctions
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• STACS 2004
• STACS 2004
• Algorithms – ESA 2005
• STACS 2005

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