A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
The Probability of Load Balancing Success in a Homogeneous Network
IEEE Transactions on Software Engineering
Implementation of decentralized load sharing in networked workstations using the Condor package
Journal of Parallel and Distributed Computing
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
Network analysis and troubleshooting
Network analysis and troubleshooting
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
IEEE Transactions on Parallel and Distributed Systems
Adaptive Location Policies for Global Scheduling
IEEE Transactions on Software Engineering
Measures of the Potential for Load Sharing in Distributed Computing Systems
IEEE Transactions on Software Engineering
Grids and grid technologies for wide-area distributed computing
Software—Practice & Experience
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
Load Balancing in Distributed Systems
IEEE Transactions on Software Engineering
Strategies for CORBA Middleware-Based Load Balancing
IEEE Distributed Systems Online
Future Generation Computer Systems
Hi-index | 0.00 |
Distributed computing systems consist of computers interconnected by communications links. In such systems, Load sharing is an important technique used to improve system performance in which jobs are transferred from overloaded nodes to underloaded ones. However, due to the ubiquitous and inescapable presence of network latencies, various pitfalls arise which can adversely affect the beneficial effects of job transfer. In this paper, we present an investigation into the effect of network latency on load sharing. The notions of Transfer Pair, and Load-Sharing Window are rigorously defined. A general expression for the probability distribution function of the Load-Sharing Window is derived. A class of rules, called quantile rules, is introduced and their role in avoiding unproductive job redistribution in spite of network latency, as well as to make multiple job transfers, is explained. The general technique is applied to the specific case of a distributed computing system consisting of M/M/1 queues. For this case, an expression for the mean of the Load-Sharing Window is derived. Numerical computations are presented, and their significance discussed.