Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-24T04:00:23.888Z Has data issue: false hasContentIssue false
  • English
  • Français

Studying Balanced Allocations with Differential Equations

Published online by Cambridge University Press:  01 September 1999

MICHAEL MITZENMACHER
MICHAEL MITZENMACHER
Affiliation:
Digital Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, USA (e-mail: michaelm@pa.dec.com)
Get access Rights & Permissions [Opens in a new window]

Abstract

Using differential equations, we examine the GREEDY algorithm studied by Azar, Broder, Karlin and Upfal for distributed load balancing [1]. This approach yields accurate estimates of the actual load distribution, provides insight into the exponential improvement GREEDY offers over simple random selection, and allows one to prove tight concentration theorems about the loads in a straightforward manner.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 5 , September 1999 , pp. 473 - 482
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

A preliminary version of this work appeared in the Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science, October 1996.