Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Deciding which queue to join: Some counterexamples
Operations Research
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
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
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Closed-loop control with delayed information
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Cluster-based scalable network services
Proceedings of the sixteenth ACM symposium on Operating systems principles
Analysis of simple algorithms for dynamic load balancing
Mathematics of Operations Research
Load balancing and density dependent jump Markov processes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
ICHU model for processor allocation in distributed operating systems
ACM SIGOPS Operating Systems Review
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Improving the scalability of the CORBA event service with a multi-agent load balancing algorithm
Software—Practice & Experience
Performance study of dispatching algorithms in multi-tier web architectures
ACM SIGMETRICS Performance Evaluation Review
Routing in Queues with Delayed Information
Queueing Systems: Theory and Applications
When the Herd Is Smart: Aggregate Behavior in the Selection of Job Request
IEEE Transactions on Parallel and Distributed Systems
A Scheduling Model for Grid Computing Systems
GRID '01 Proceedings of the Second International Workshop on Grid Computing
A Fuzzy Load Balancing Service for Network Computing Based on Jini
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A new fuzzy-decision based load balancing system for distributed object computing
Journal of Parallel and Distributed Computing
Dimension-exchange algorithms for token distribution on tree-connected architectures
Journal of Parallel and Distributed Computing
Tunable randomization for load management in shared-disk clusters
ACM Transactions on Storage (TOS)
Handling Heterogeneity in Shared-Disk File Systems
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
SEcS: scalable edge-computing services
Proceedings of the 2005 ACM symposium on Applied computing
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
A template based static coalition protocol: a3P viGrid
ACSW Frontiers '06 Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54
IEEE Transactions on Computers
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
IEEE Transactions on Parallel and Distributed Systems
MARO - MinDrift affinity routing for resource management in heterogeneous computing systems
CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
International Journal of High Performance Computing and Networking
Simple summaries for hashing with choices
IEEE/ACM Transactions on Networking (TON)
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
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Adaptive routing with stale information
Theoretical Computer Science
Load balancing: toward the infinite network and beyond
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
On fully distributed adaptive load balancing
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
On cost-aware monitoring for self-adaptive load sharing
IEEE Journal on Selected Areas in Communications
The Journal of Supercomputing
A predictive and probabilistic load-balancing algorithm for cluster-based web servers
Applied Soft Computing
The price of forgetting in parallel and non-observable queues
Performance Evaluation
Multi-site scheduling with multiple job reservations and forecasting methods
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
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
Cost aware adaptive load sharing
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
Distributed oblivious load balancing using prioritized job replication
Proceedings of the 8th International Conference on Network and Service Management
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Sparrow: distributed, low latency scheduling
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Hi-index | 0.01 |
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 multiprocessor 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 queue lengths from $T$ seconds ago. What is a good strategy for choosing a processor in order for tasks to minimize their expected time in the system? Such models can also be used to describe settings where there is a transfer delay between the time a task enters a system and the time it reaches a processor for service. Our models are based on considering the behavior of limiting systems where the number of processors goes to infinity. The limiting systems can be shown to accurately describe the behavior of sufficiently large systems and simulations demonstrate that they are reasonably accurate even for systems with a small number of processors. Our studies of specific models demonstrate the importance of using randomness to break symmetry in these systems and yield important rules of thumb for system design. The most significant result is that only small amounts of queue length information can be extremely useful in these settings; for example, having incoming tasks choose the least loaded of two randomly chosen processors is extremely effective over a large range of possible system parameters. In contrast, using global information can actually degrade performance unless used carefully; for example, unlike most settings where the load information is current, having tasks go to the apparently least loaded server can significantly hurt performance.