Kim Jun Hyung, Oh Ha Ryoung, Lee Jae Moon

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 3, pp. 288-298, Apr. 1995
10.3745/KIPSTE.1995.2.3.288,   PDF Download:

Abstract

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server-initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme cases. State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication. Using this model, the problem of load balancing is converted to that of maintaining the rithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

Statistics
Cite this article