Deterministic monotone algorithms for scheduling on related machines
From MaRDI portal
Publication:952439
DOI10.1016/j.tcs.2008.06.050zbMath1160.68004OpenAlexW2101216862MaRDI QIDQ952439
Vincenzo Auletta, Pasquale Ambrosio
Publication date: 12 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.050
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic mechanism design (extended abstract)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Bounds for List Schedules on Uniform Processors
- Optimal Auction Design
- Incentives in Teams
- Bounds for LPT Schedules on Uniform Processors
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-Line Load Balancing for Related Machines
- STACS 2004
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Deterministic monotone algorithms for scheduling on related machines