The probability of load balancing success in a homogeneous network
CG Rommen - IEEE Transactions on Software Engineering, 1991 - search.proquest.com
CG Rommen
IEEE Transactions on Software Engineering, 1991•search.proquest.comThe problem of load balancing in distributed processing systems composed of several
homogeneous sites connected by a subnet is examined. A general formula is determined for
the probability that any one site in the system is underloaded while another site is
overloaded. This probability can be used to define the likelihood of load balancing success
in a distributed operating system. This probability gives insight into the utilization of the
system and is a useful aid in determining a measure of effectiveness of the system. From the …
homogeneous sites connected by a subnet is examined. A general formula is determined for
the probability that any one site in the system is underloaded while another site is
overloaded. This probability can be used to define the likelihood of load balancing success
in a distributed operating system. This probability gives insight into the utilization of the
system and is a useful aid in determining a measure of effectiveness of the system. From the …
Abstract
The problem of load balancing in distributed processing systems composed of several homogeneous sites connected by a subnet is examined. A general formula is determined for the probability that any one site in the system is underloaded while another site is overloaded. This probability can be used to define the likelihood of load balancing success in a distributed operating system. This probability gives insight into the utilization of the system and is a useful aid in determining a measure of effectiveness of the system. From the formula, one can determine this probability when a workload is composed of processes typical to certain distributed systems. The influence of variants in the load balancing algorithm on this probability is also demonstrated.
ProQuest