See this document in CiteSeerX!

Interpreting Stale Load Information (1998)  (Make Corrections)  (15 citations)
Michael Dahlin
IEEE Transactions on Parallel and Distributed Systems



  Home/Search   Context   Related

 
View or download:
utexas.edu/pub/techrepor...tr9820.ps.Z
utexas.edu/ftp/pub/techr...tr9820.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  utexas.edu/users...Abstracts.1998 (more)
(Enter author homepages)

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

Abstract: In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each request to the machine with the apparent lowest load can behave badly in such systems, yet this technique is common in practice. Other systems use round-robin or random selection algorithms that entirely ignore load information or that only use a small subset of the load information. Rather than risk extremely bad... (Update)

Context of citations to this paper:   More

.... the recency of the load information determines its accuracy, such an approach can result in decisions based on inaccurate information [10]. Further, if token passing is not too frequent, exchanging load information results in wasted messages. The advantage though is that a new...

...and network conditions) Random subsets would allow CDNs to track the state of a subset of global replicas. A number of earlier studies [9] indicate that making decisions based on a random subset of global information often performs comparably to maintaining global system state....

Cited by:   More
Using Random Subsets to Build Scalable Network Services - Dejan Kostic Adolfo (2003)   (Correct)
Adaptive Routing with Stale Information - Fischer, Vöcking (2005)   (Correct)
A Demand Adaptive and Locality Aware (DALA) Streaming - Media Server Cluster   (Correct)

Similar documents (at the sentence level):
77.3%:   Interpreting Stale Load Information - Dahlin (1999)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Practical Load Balancing for Content Requests in.. - Roussopoulos, Baker (2003)   (Correct)
0.2:   Mean-Field Approximation for Stochastic Transportation.. - Khmelev, Oseledets (1999)   (Correct)
0.1:   Service Rebalancing - II, Finkel (1993)   (Correct)

Similar documents based on text:   More   All
0.2:   A Simple Yet Effective Load Balancing Extension to the PVM.. - Jackson, Humphres (1997)   (Correct)
0.1:   Hierarchical Cache Consistency in a WAN - Yin, Alvisi, Dahlin, Lin (1999)   (Correct)
0.1:   Eliminating Stale Data References through Array Data-Flow Analysis - Choi, Yew (1996)   (Correct)

Related documents from co-citation:   More   All
11:   How useful is old information - Mitzenmacher - 1997
6:   Cluster-based scalable network services - Fox, Gribble et al. - 1997
6:   Adaptive load sharing in homogeneous distributed systems (context) - Eager, Lazowska et al. - 1986

BibTeX entry:   (Update)

Michael Dahlin. Interpreting stale load information. In The 19th IEEE International Conference on Distributed Computing Systems (ICDCS), Austin, TX, May 1999. http://citeseer.ist.psu.edu/article/dahlin98interpreting.html   More

@article{ dahlin00interpreting,
    author = "M. Dahlin",
    title = "Interpreting Stale Load Information",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    volume = "11",
    number = "10",
    pages = "33--??",
    year = "2000",
    url = "citeseer.ist.psu.edu/article/dahlin98interpreting.html" }
Citations (may not include all citations):
566   Condor -- A Hunter of Idle Workstations (context) - Litzkow, Livny et al. - 1988
266   Adaptive Load Sharing in Homogeneous Distributed Systems (context) - Eager, Lazowska et al. - 1986
241   Transparent Process Migration: Design Alternatives and the S.. - Douglis, Ousterhout - 1991
140   Experiences with the Amoeba Distributed Operating System - Tanenbaum, van Renesse et al. - 1990
123   Preemptable Remote Execution Facilities for the V-System (context) - Theimer, Cheriton - 1985
106   Locating Nearby Copies of Replicated Internet Servers - Guyton, Schwartz - 1995
93   Designing a Process Migration Facility: The Charlotte Experi.. - Artsy, Finkel - 1989
91   Balanced Allocations - Azar, Broder et al. - 1994
90   Using Smart Clients to Build Scalable Services - Yoshikawa, Chun et al. - 1997
85   Attacking the Process Migration Bottleneck (context) - Zayas - 1987
81   Efficient PRAM Simulation on a Distributed Memory Machine - Karp, Luby et al. - 1992
79   BSPlib: The BSP Programming Library - Hill, McColl et al. - 1997
78   Utopia: A Load Sharing Facility for Large (context) - Zhou, Wang et al. - 1993
75   Process Migration in DEMOS/MP (context) - Powell, Miller - 1983
66   The Power of Two Choices in Randomized Load Balancing - Mitzenmacher - 1996
64   Squid Internet Object Cache (context) - Wessels - 1998
62   Using Idle Workstations in a Shared Computing Environment (context) - Nichols - 1987
58   How Useful is Old Information - Mitzenmacher - 1998
53   DNS Support for Load Balancing (context) - Brisco - 1995
48   Performance Characteristics of Mirror Servers on the Interne.. - Myers, Dinda et al. - 1998
40   Adaptive Load Sharing in Heterogeneous Distributed Systems (context) - Mirchandaney, Towsley et al. - 1990
31   MARS -- A Framework for Minimizing the Job Execution Time in.. - Gehring, Reinefeld - 1996
30   Making Commitments in the Face of Uncertainty: How to Pick a.. - Awerbuch, Azar et al. - 1996
27   Analysis of the Effects of Delays on Load Sharing (context) - Mirchandaney, Towsley et al. - 1989
19   Research Toward a Heterogeneous Networked Computing Cluster:.. (context) - Duke, Green et al. - 1996
12   Load distribution: Implementation for the Mach Microkernel (context) - Milojicic - 1993
10   Network Tasking in the Locus Distributed Unix System (context) - Butterfield, Popek - 1984
9   Cisco Distributed Director (context) - Delgadillo - 1997
8   Towards Developing Universal Dynamic Mapping Algorithms - Decker, Diekmann et al. - 1995
5   Queuing Systems with Selection of the Shortest of Two Queues.. (context) - Vvedenskaya, Dobrushin et al. - 1996
3   white papers/ slbwp (context) - Step, Load et al. - 1998



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.utexas.edu/users/UTCS/techreports/index/html/Abstracts.1998.html):   More
Coordinated Placement and Replacement for Large-Scale.. - Korupolu, Dahlin (1998)   (Correct)
Design Considerations for Distributed Caching on the Internet - Tewari, Dahlin, Vin, Kay (1998)   (Correct)
Fast and Exact Simultaneous Gate and Wire Sizing by.. - Chen, Chu, Wong (1997)   (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