Title :
The probability of load balancing success in a homogeneous network
Author_Institution :
Dept. of Math. & Comput. Sci., Eastern Connecticut State Univ., Willimantic, CT
fDate :
9/1/1991 12:00:00 AM
Abstract :
The problem of load balancing in distributed systems composed of several homogeneous sites connected by a subnet is examined. The author determines a general formula for the probability that any one site in the system is underloaded while some other site in the system 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 an aid in determining a measure of effectiveness of the system. From this formula one can determine this probability when the workload is composed of processes typical to distributed systems. The influence of variants in the load balancing algorithm on this probability is demonstrated
Keywords :
computer networks; distributed processing; operating systems (computers); probability; distributed operating system; general formula; homogeneous sites; load balancing algorithm; subnet; Computer networks; Concurrent computing; Distributed processing; Intelligent networks; Load management; Local area networks; Operating systems; Processor scheduling; Queueing analysis; Tail;
Journal_Title :
Software Engineering, IEEE Transactions on
