The Community for Technology Leaders
Proceedings of IEEE International Conference on Distributed Computing Systems - ICDCS '93 (1993)
Pittsburgh, PA, USA
May 25, 1993 to May 28, 1993
ISBN: 0-8186-3770-6
pp: 482-489
Hwa-Chun Lin , Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
ABSTRACT
Exact performance analyses of dynamic load-balancing policies for distributed systems are very difficult because the state space is multidimensional and load-balancing decisions are state-dependent. A state-aggregation method is proposed to analyze the performance of dynamic load-balancing policies. Those states with the same number of jobs are aggregated into a single state. The number of jobs in the system is modeled by a birth-death Markov process. The state transition rates are estimated by an iterative procedure. The proposed state-aggregation method is applied to analyze the performance of a particular dynamic load-balancing policy, namely a symmetric policy with threshold value equal to one. Extensive simulations were performed to study the accuracy of the state-aggregation method. This method provides accurate performance estimates for the symmetric policy for systems of various sizes when the mean job transfer delay is small compared to the average job service time.<>
INDEX TERMS
delays, distributed processing, performance evaluation, resource allocation, state-space methods
CITATION

Hwa-Chun Lin and C. Raghavendra, "A state-aggregation method for analyzing dynamic load-balancing policies," Proceedings of IEEE International Conference on Distributed Computing Systems - ICDCS '93(ICDCS), Pittsburgh, PA, USA, , pp. 482-489.
doi:10.1109/ICDCS.1993.287676
108 ms
(Ver 3.3 (11022016))