Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Using idle workstations in a shared computing environment
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Attacking the process migration bottleneck
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
Experiences with the Amoeba distributed operating system
Communications of the ACM
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Utopia: a load sharing facility for large, heterogeneous distributed computer systems
Software—Practice & Experience
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
MARS—a framework for minimizing the job execution time in a metacomputing environment
Future Generation Computer Systems - Special issue: resource management in distributed systems
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Towards developing universal dynamic mapping algorithms
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Using smart clients to build scalable services
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Performance study of dispatching algorithms in multi-tier web architectures
ACM SIGMETRICS Performance Evaluation Review
Request Redirection Algorithms for Distributed Web Systems
IEEE Transactions on Parallel and Distributed Systems
Fine grain performance evaluation of e-commerce sites
ACM SIGMETRICS Performance Evaluation Review
Computing on the edge: a platform for replicating internet applications
Web content caching and distribution
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Quality-constrained routing in publish/subscribe systems
MPAC '05 Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing
Load prediction models in web-based systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
The Grid Resource Broker, a ubiquitous grid computing framework
Scientific Programming
Adaptive data placement for wide-area sensing services
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Models and framework for supporting runtime decisions in Web-based systems
ACM Transactions on the Web (TWEB)
A content-based load balancing algorithm with admission control for cluster web servers
Future Generation Computer Systems
Architecture and performance models for QoS-driven effective peering of content delivery networks
Multiagent and Grid Systems - Content management and delivery through P2P-based content networks
Adaptive routing with stale information
Theoretical Computer Science
An extended ns-2 for validation of load balancing algorithms in Content Delivery Networks
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
The Journal of Supercomputing
A predictive and probabilistic load-balancing algorithm for cluster-based web servers
Applied Soft Computing
An up-to-date survey in web load balancing
World Wide Web
A matrix-analytic solution for randomized load balancing models with PH service times
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
A distributed control law for load balancing in content delivery networks
IEEE/ACM Transactions on Networking (TON)
Detecting correlation between server resources for system management
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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 performance on one hand or ignore the chance to use load information to improve performance on the other, we develop strategies that interpret load information based on its age. Through simulation, we examine several simple algorithms that use such load interpretation strategies under a range of workloads. Our experiments suggest that by properly interpreting load information, systems can: 1) match the performance of the most aggressive algorithms when load information is fresh relative to the job arrival rate, 2) outperform the best of the other algorithms we examine by as much as 60 percent when information is moderately old, 3) significantly outperform random load distribution when information is older still, and 4) avoid pathological behavior even when information is extremely old.