See this document in CiteSeerX!

Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input (2005)  (Make Corrections)  
Aris Anagnostopoulos, Adam Kirsch, Eli Upfal



  Home/Search   Context   Related

 
View or download:
brown.edu/people/e...20Vol34%202005.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  brown.edu/research/proje...online (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study the long-term (steady state) performance of a simple, randomized, local load balancing technique under a broad range of input conditions. 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. A node can execute one job per step, and can also... (Update)

Active bibliography (related documents):   More   All
2.2:   Load Balancing in Arbitrary Network Topologies with.. - Anagnostopoulos.. (2005)   (Correct)
1.2:   Stability and Efficiency of a Random Local Load.. - Anagnostopoulos.. (2003)   (Correct)
0.2:   Adversarial Queuing Theory - Borodin, Kleinberg, Raghavan, Sudan, .. (2001)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ anagnostopoulos-load,
  author = "Aris Anagnostopoulos and Adam Kirsch and Eli Upfal",
  title = "Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial
    Input",
  url = "citeseer.ist.psu.edu/article/anagnostopoulos05load.html" }
Citations (may not include all citations):
1749   An Introduction to Probability Theory and Its Application (context) - Feller - 1971
366   Markov Chains and Stochastic Stability - Meyn, Tweedie - 1993
148   A First Course in Stochastic Processes (context) - Karlin, Taylor - 1975
54   The token distribution problem (context) - Peleg, Upfal - 1989
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. - 1999
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.. - uling, Monien - 1993
9   Moment conditions for a sequence with negative drift to be u.. - Pemantle, Rosenthal
7   An adversarial model for distributed dynamic load balancing - Muthukrishnan, Rajaraman - 1998
7   Dynamic load balancing by random matchings (context) - Ghosh, Muthukrishnan - 1996
3   Stability of load balancing in dynamic adversarial systems (context) - Anshelevich, Kempe et al. - 2002
3   The natural work-stealing algorithm is stable - Berenbrink, Friedetzky et al. - 2003
2   Analyses of load stealing models based on di#erential equati.. (context) - Mitzenmacher - 1998
2   ciency of a random local load balancing protocol (context) - Anagnostopoulos, Kirsch et al. - 2003

Documents on the same site (http://www.cs.brown.edu/research/projects/online.html):   More
Online Stochastic Optimization without Distributions - Bent, Van Hentenryck (2004)   (Correct)
Online Stochastic and Robust Optimization - Bent, Van Hentenryck (2004)   (Correct)
Dynamic Vehicle Routing with Stochastic Requests - Bent, Van Hentenryck (2003)   (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