WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION
From MaRDI portal
Publication:3016228
DOI10.1142/S0129054111008519zbMath1216.68065MaRDI QIDQ3016228
Publication date: 14 July 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
performance evaluation; on-line algorithm; virtual machine; multiprocessor task scheduling; resource augmentation
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- On-line scheduling of parallel jobs in a list
- A note on online strip packing
- Resource augmentation in load balancing.
- Applying extra-resource analysis to load balancing.
- On-line scheduling revisited
- Shelf Algorithms for Two-Dimensional Packing Problems
- Speed is as powerful as clairvoyance
- Bounds for Certain Multiprocessing Anomalies