Applying extra-resource analysis to load balancing.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1305389 (Why is no real title available?)
- scientific article; zbMATH DE number 1305455 (Why is no real title available?)
- scientific article; zbMATH DE number 1306855 (Why is no real title available?)
- scientific article; zbMATH DE number 1559529 (Why is no real title available?)
- scientific article; zbMATH DE number 1559597 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- A 13/12 approximation algorithm for bin packing with extendable bins
- Bounds for Certain Multiprocessing Anomalies
- Competitive paging with locality of reference
- Improved bounds for harmonic-based bin packing algorithms
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
- Scheduling in the dark
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- `` Strong NP-Completeness Results
Cited in
(7)- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
- Parallel machines scheduling with machine maintenance for minsum criteria
- Minimizing the maximum starting time on-line
- A tighter extra-resource analysis of online deadline scheduling
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- scientific article; zbMATH DE number 1445349 (Why is no real title available?)
- Robust surgery loading
This page was built for publication: Applying extra-resource analysis to load balancing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588056)