Offline file assignments for online load balancing

Paul Dütting, Monika Henzinger, Ingmar Weber

Research output: Contribution to journalArticle

4 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)178-183
Number of pages6
JournalInformation Processing Letters
Issue number4
Publication statusPublished - 15 Jan 2011



  • File distribution
  • Information retrieval
  • Load balancing
  • On-line algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this