Offline file assignments for online load balancing
From MaRDI portal
Publication:1944067
DOI10.1016/j.ipl.2010.11.022zbMath1260.68471OpenAlexW2113380015WikidataQ60241787 ScholiaQ60241787MaRDI QIDQ1944067
Ingmar Weber, Paul Dütting, Monika R. Henzinger
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.022
Analysis of algorithms (68W40) Information storage and retrieval of data (68P20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Online algorithms. The state of the art
- Online algorithms: a survey
- On-line scheduling revisited
- Improved Bounds for the Online Scheduling Problem
- Probability Inequalities for Sums of Bounded Random Variables
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Offline file assignments for online load balancing