Summary: Load Balancing in the L p Norm
Baruch Awerbuch \Lambda Yossi Azar y Edward F. Grove z
Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science
Johns Hopkins University Tel­Aviv University Duke University
Baltimore, MD 21218 Tel­Aviv 69978, Israel Durham, NC 27708--0129
baruch@cs.jhu.edu azar@math.tau.ac.il efg@cs.duke.edu
Ming­Yang Kao x P. Krishnan -- Jeffrey Scott Vitter k
Dept. of Computer Science Computing Systems Res. Lab. Dept. of Computer Science
Duke University AT&T Bell Laboratories Duke University
Durham, NC 27708--0129 Holmdel, NJ 07733--3030 Durham, NC 27708--0129
kao@cs.duke.edu pk@research.att.com jsv@cs.duke.edu
Abstract
In the load balancing problem, there is a set of servers,
and jobs arrive sequentially. Each job can be run
on some subset of the servers, and must be assigned
to one of them in an online fashion. Traditionally,
the assignment of jobs to servers is measured by the
L1 norm; in other words, an assignment of jobs to
servers is quantified by the maximum load assigned to
any server. In this measure the performance of the

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences