Abstract
Unlike most other adaptive load sharing (LS) policy studies, each node in the distributed system is modeled as a central server model represented by a closed queueing network (QN). The primary objective of this study is to use a simulation model to find the improvement for an adaptive LS policy in a distributed system. In homogeneous distributed systems, the simulation results in this study show that the performance improvements between no LS, LS with task placement, and LS with task migration are very small. These results are quite different from other studies, which show a significant improvement of mean response time by executing the LS policy. The performance improvement for the heterogeneous system is very consistent. That is, the benefit is given to every congested node in the system.
Recommended Citation
Y. J. Hu and B. E. Gillett, "Simulating Adaptive Load Sharing Policies On An IPSC/2 Multicomputer," 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings, pp. 238 - 241, article no. 633135, Institute of Electrical and Electronics Engineers, Jan 1991.
The definitive version is available at https://doi.org/10.1109/DMCC.1991.633135
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-081862290-8
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 1991
