Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Attacking the process migration bottleneck
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
The limited performance benefits of migrating active processes for load sharing
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Object management in local distributed systems
Journal of Systems and Software
IEEE Transactions on Software Engineering
Experiences with the Amoeba distributed operating system
Communications of the ACM
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Utopia: a load sharing facility for large, heterogeneous distributed computer systems
Software—Practice & Experience
Load Distribution: Implementation for the MACH Microkernel
Load Distribution: Implementation for the MACH Microkernel
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
An Empirical Investigation of Load Indices for Load Balancing Applications
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
A Simple MPI Process Swapping Architecture for Iterative Applications
International Journal of High Performance Computing Applications
An adaptive load balancing management technique for RFID middleware systems
Software—Practice & Experience
| Hi-index | 0.00 |
The paper presents the results of an experimental study of load balancing using job initiation and process migration, carried out on Amoeba (A.S. Tanenbaum et al., 1990). The results indicate the need for a load balancing facility in a distributed system to improve system performance, e.g., the average response time of processes. A number of load balancing algorithms, including the bidding and neighbouring algorithms, have been studied in this work. A comparison between these algorithms under various conditions is presented, which indicates that in a system with 10-20 computers, a centralized algorithm outperforms a distributed one and job initiation plays an important role in a load balancing scheme. We also point out some requirements for an operating system in order to support an efficient load balancing facility, on the basis of our experience. We conclude with a summary of our experiences and suggestions for further work.