Sensitivity Study of the Load Balancing Algorithm in a Distributed System
暂无分享,去创建一个
Abstract This paper explains the sensitivity of load balancing performance in a distributed system. The focus of this study is load balancing and its relation to optimal process and read site placement. The system model is based on the LOCUS distributed file system. This system allows replicated files. Process migration is included in the simulation system model. Synchronization policy is enforced by the CSS (Centralized Synchronization Sites) program. All requests to open a file for access must be sent to the file's CSS. The CSS checks for access conflicts. An algorithm that increases system performance through load balancing is provided. This algorithm bases its decisions on data collected by the system. Sensitivity of the algorithm characteristics and performance are analyzed and discussed.
[1] Anna Hać. A distributed algorithm for performance improvement through file replication, file migration and process migration , 1986 .
[2] Edward D. Lazowska,et al. A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.
[3] Yung-Terng Wang,et al. Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.
[4] Bruce Walker,et al. The LOCUS distributed operating system , 1983, SOSP '83.