Offline file assignments for online load balancing

Authors:
Paul Dütting;Monika Henzinger;Ingmar Weber
Affiliations:
Ecole Polytechnique Fédérale de Lausanne (EPFL), Station 14, CH-1015 Lausanne, Switzerland;University of Vienna, Faculty of Computer Science, Universitaetsstrasse 10, A-1090 Wien, Austria;Yahoo! Research Barcelona, Av. Diagonal 177, E-08003 Barcelona, Spain
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 0

The competitiveness of on-line assignments

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online computation and competitive analysis

Online computation and competitive analysis
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
Improved Bounds for the Online Scheduling Problem

SIAM Journal on Computing
Web Search for a Planet: The Google Cluster Architecture

IEEE Micro
Inverted files for text search engines

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased by this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability.