Aris Anagnostopoulos, Adam Kirsch, Eli Upfal  Home/Search
Context Related
| harvard.edu/~kirsch/pubs/lbst...focs.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: harvard.edu/~kirsch/pubs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the long term (steady state) performance of a simple, randomized, local load balancing technique. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversary. The adversary knows the current and past load distribution in the network and can use this information to place the new tasks in the processors. The adversary can put a number of new jobs in each processor, in each step, as long as the ... (Update)
Cited by: More
Simple Efficient Load Balancing Algorithms for Peer-to-Peer.. - David Karger Mit (2004) (Correct)
Active bibliography (related documents): More All
1.2: Load Balancing in Arbitrary Network Topologies with.. - Anagnostopoulos.. (2005) (Correct)
0.2: Dimension-Exchange Algorithms for Load Balancing on Trees - Houle, Symvonis, Wood (2002) (Correct)
0.2: Adversarial Queuing Theory - Borodin, Kleinberg, Raghavan, Sudan, .. (2001) (Correct)
Similar documents based on text: More All
0.2: Persistent Authenticated Dictionaries and Their.. - Anagnostopoulos.. (2001) (Correct)
0.2: Sampling Search-Engine Results - Aris Anagnostopoulos Dept (2005) (Correct)
0.1: Simple Summaries for Hashing with Multiple Choices - Kirsch, Mitzenmacher (Correct)
Related documents from co-citation: More All
2: A stochastic process on the hypercube with applications to peer-to-peer networks - Adler, Halperin et al. - 2003
2: Skip graphs (context) - Aspnes, Shah - 2003
2: Distributed balanced tables: Not making a hash of it all (context) - Ganesan, Bawa - 2003
BibTeX entry: (Update)
Aris Anagnostopoulos, Adam Kirsch, and Eli Upfal. Stability and Efficiency of a Random Local Load Balancing Protocol. In Proceedings FOCS, pages 472--481, 2003. http://citeseer.ist.psu.edu/anagnostopoulos03stability.html More
@misc{ anagnostopoulos03stability,
author = "A. Anagnostopoulos and A. Kirsch and E. Upfal",
title = "Stability and Efficiency of a Random Local Load Balancing Protocol",
text = "Aris Anagnostopoulos, Adam Kirsch, and Eli Upfal. Stability and Efficiency
of a Random Local Load Balancing Protocol. In Proceedings FOCS, pages 472--481,
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/anagnostopoulos03stability.html" }
Citations (may not include all citations):101 Applied Probability Models with Optimization Applications (context) - Ross - 1970
54 The token distribution problem (context) - Peleg, Upfal - 1989
52 A simple load balancing scheme for task allocation in parall.. - Rudolph, Slivkin-Allalouf et al. - 1991
41 Load balancing and density dependent jump Markov processes (context) - Mitzenmacher - 1996
35 Tight analyses of two local load balancing algorithms - Ghosh, Leighton et al. - 2000
34 Approximate load balancing on dynamic and asynchronous netwo.. - Aiello, Awerbuch et al. - 1993
32 Adversarial queuing theory - Borodin, Kleinberg et al. - 2001
30 Strongly adaptive token distribution - auf, Oesterdiekhoff et al. - 1993
28 A dynamic distributed load balancing algorithm with provable.. - Luling, Monien - 1993
14 Iterative dynamic load balancing in multicomputers - Xu, Lau - 1994
10 Local divergence of markov chains and the analysis of iterat.. - Rabani, Sinclair et al. - 1998
9 Moment conditions for a sequence with negative drift to be u.. - Pemantle, Rosenthal - 1999
9 Load balancing and workstation autonomy on Amoeba - Zhu, Steketee et al. - 1995
7 Dynamic load balancing by random matchings (context) - Ghosh, Muthukrishnan - 1996
7 An adversarial model for distributed dynamic load balancing - Muthukrishnan, Rajaraman - 1998
6 Analyses of load stealing models based on differential equat.. - Mitzenmacher, Center - 1998
3 The natural work-stealing algorithm is stable - Berenbrink, Friedetzky et al. - 2001
3 Stability of load balancing in dynamic adversarial systems (context) - Anshelevich, Kempe et al. - 2002
Documents on the same site (http://www.eecs.harvard.edu/~kirsch/pubs/): More
Simple Summaries for Hashing with Multiple Choices - Kirsch, Mitzenmacher (Correct)
TBBL: A Tree-Based Bidding Language for Iterative.. - Ruggiero Cavallo David (Correct)
Load Balancing in Arbitrary Network Topologies with.. - Anagnostopoulos.. (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC