Performance analysis of local computer networks
Performance analysis of local computer networks
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A comparison of priority-based decentralized load balancing policies
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Simulation of Computer Communication Systems
Simulation of Computer Communication Systems
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
A game-theoretic model for dynamic load balancing in distributed systems
Proceedings of the International Conference on Advances in Computing, Communication and Control
| Hi-index | 0.00 |
In this paper, a simple decentralized dynamic load balancing algorithm, is presented. The algorithm is a variant of “join the shortest queue” algorithm. It uses remote jobs as carriers to transfer current node state information between nodes. We assume that remote jobs are partially processed at the remote sites and return back to their original site for more processing. A simulation model for a homogeneous distributed system was developed to compare the performance of the algorithm with previously proposed ones. The results show that the performance of this algorithm, which collects state information with virtually no additional communication load, is close to that of algorithms using regularly updated global information. Such results support, using an entirely different model, the results obtained in