Michael Mitzenmacher  Home/Search
Context Related
| digital.com/pub/DE...SRC1998002.ps.gz 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: dec.com/pub/DEC...srctn1998002 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Michael Mitzenmacher # Abstract We consider the problem of load balancing in dynamic distributed systems in cases where new incoming tasks can make use of old information. For example, consider a multi-processor system where incoming tasks with exponentially distributed service requirements arrive as a Poisson process, the tasks must choose a processor for service, and a task knows when making this choice the processor loads from T seconds ago. What is a good strategy for choosing a... (Update)
Context of citations to this paper: More
.... from a set of randomly chosen d servers is often better than trying to choose the least loaded server from the whole set of servers [21]. The value of d can be as low as two. This is an interesting result in the context of distributed systems like the WWW where...
...paths, if available. Similar observations appear in studies of load balancing among servers with out of date information about server load [25]. Another technique is to use coarse grained link metrics to increase the likelihood of ties among several similar (but not...
Cited by: More
Load-Sensitive Routing of Long-Lived IP Flows - Shaikh, Rexford, Shin (1999) (Correct)
Efficient Data Dissemination in the World Wide Web - Srinivasan, Eager (1998) (Correct)
Similar documents (at the sentence level):
75.5%: How Useful is Old Information? - Mitzenmacher (1997) (Correct)
Active bibliography (related documents): More All
0.4: The Power of Two Random Choices: A Survey of Techniques .. - Mitzenmacher, Richa.. (2000) (Correct)
0.4: Delayed Information and Action in On-Line Algorithms - Albers, Charikar, Mitzenmacher (1998) (Correct)
0.3: On the Analysis of Randomized Load Balancing Schemes - Mitzenmacher (1998) (Correct)
Similar documents based on text: More All
0.2: Geometric Generalizations of the Power of Two Choices - Byers, Considine, Mitzenmacher (2003) (Correct)
0.1: Load Balancing with Memory - Mitzenmacher, Prabhakar, Shah (Correct)
0.1: Improved Low-Density Parity-Check Codes Using.. - Luby.. (1998) (Correct)
BibTeX entry: (Update)
Michael Mitzenmacher, "How Useful is Old Information?", Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997. http://citeseer.ist.psu.edu/mitzenmacher98how.html More
@article{ mitzenmacher00how,
author = "M. Mitzenmacher",
title = "How Useful Is Old Information?",
journal = "IEEE Transactions on Parallel and Distributed Systems",
volume = "11",
number = "1",
pages = "6--??",
year = "2000",
url = "citeseer.ist.psu.edu/mitzenmacher98how.html" }
Citations (may not include all citations):266 Adaptive load sharing in homogeneous distributed systems (context) - Eager, Lazowska et al. - 1986
192 Markov Processes: Characterization and Convergence (context) - Ethier, Kurtz - 1986
91 Balanced Allocations - Azar, Broder et al. - 1994
86 Large Deviations for Performance Analysis (context) - Shwartz, Weiss - 1995
81 Efficient PRAM Simulation on a Distributed Memory Machine - Karp, Luby et al. - 1992
66 The Power of Two Choices in Randomized Load Balancing - Mitzenmacher - 1996
46 Approximation of Population Processes (context) - Kurtz - 1981
45 The Efficiency of Greedy Routing in Hypercubes and Butterfli.. (context) - Stamoulis, Tsitsiklis - 1994
41 Load Balancing and Density Dependent Jump Markov Processes (context) - Mitzenmacher - 1996
41 Optimality of the Shortest Line Discipline (context) - Winston - 1977
40 Adaptive Load Sharing in Heterogeneous Distributed Systems (context) - Mirchandaney, Towsley et al. - 1990
35 the Analysis of Randomized Load Balancing Schemes - Mitzenmacher
30 Making Commitments in the Face of Uncertainty: How to Pick a.. - Awerbuch, Azar et al. - 1996
27 the Optimal Assignment of Customers to Parallel Servers (context) - Weber - 1978
27 Analysis of the Effects of Delays on Load Sharing (context) - Mirchandaney, Towsley et al. - 1989
22 Queueing System with Selection of the Shortest of Two Queues.. (context) - Vvedenskaya, Dobrushin et al. - 1996
20 Deciding Which Queue to Join: Some Counterexamples (context) - Whitt - 1986
19 Differential Equations for Random Processes and Random Graph.. (context) - Wormald - 1995
12 Analysis of Simple Algorithms for Dynamic Load Balancing - Alanyali, Hajek
11 Constant Time per Edge is Optimal on Rooted Tree Networks - Mitzenmacher - 1996
3 The Effect of Communication Delays on the Performance of Loa.. (context) - Towsley, Mirchandaney - 1988
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