Logo der Universität Wien

Offline file assignments for online load balancing

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.

GrafikTop
Authors
GrafikTop
Citation
Category
Journal Paper
Divisions
Theory and Applications of Algorithms
Journal or Publication Title
Information Processing Letters
ISSN
0020-0190
Publisher
Elsevier
Page Range
pp. 178-183
Number
4
Volume
111
Date
2011
Export
GrafikTop
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna