Offline file assignments for online load balancing

Paul Dütting, Monika Henzinger, Ingmar Weber

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

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

Fingerprint

Load Balancing
Resource allocation
Assignment
Deterministic Algorithm
Search engines
Web Search
Beat
Randomized Algorithms
Assignment Problem
Search Engine
Trade-offs
Lower bound

Keywords

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

ASJC Scopus subject areas

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

Cite this

Offline file assignments for online load balancing. / Dütting, Paul; Henzinger, Monika; Weber, Ingmar.

In: Information Processing Letters, Vol. 111, No. 4, 15.01.2011, p. 178-183.

Research output: Contribution to journalArticle

Dütting, Paul ; Henzinger, Monika ; Weber, Ingmar. / Offline file assignments for online load balancing. In: Information Processing Letters. 2011 ; Vol. 111, No. 4. pp. 178-183.
@article{496ebfb7e9bb4d1d8318045b04510ff4,
title = "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.",
keywords = "File distribution, Information retrieval, Load balancing, On-line algorithms",
author = "Paul D{\"u}tting and Monika Henzinger and Ingmar Weber",
year = "2011",
month = "1",
day = "15",
doi = "10.1016/j.ipl.2010.11.022",
language = "English",
volume = "111",
pages = "178--183",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Offline file assignments for online load balancing

AU - Dütting, Paul

AU - Henzinger, Monika

AU - Weber, Ingmar

PY - 2011/1/15

Y1 - 2011/1/15

N2 - 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.

AB - 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.

KW - File distribution

KW - Information retrieval

KW - Load balancing

KW - On-line algorithms

UR - http://www.scopus.com/inward/record.url?scp=78649528493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649528493&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2010.11.022

DO - 10.1016/j.ipl.2010.11.022

M3 - Article

VL - 111

SP - 178

EP - 183

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -