Applying extra-resource analysis to load balancing.
From MaRDI portal
Publication:1588056
DOI10.1002/1099-1425(200009/10)3:5%3C273::AID-JOS48%3E3.0.CO;2-0zbMATH Open1153.90416OpenAlexW2063156615MaRDI QIDQ1588056FDOQ1588056
Authors: Mark Brehob, Patchrawat Uthaisombut, Eric Torng
Publication date: 27 July 2003
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/1099-1425(200009/10)3:5%3C273::aid-jos48%3E3.0.co;2-0
Recommendations
Cites Work
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Competitive paging with locality of reference
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Improved bounds for harmonic-based bin packing algorithms
- `` Strong NP-Completeness Results
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
- A 13/12 approximation algorithm for bin packing with extendable bins
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling in the dark
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- 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)