This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Measures of the Potential for Load Sharing in Distributed Computing Systems
May 1995 (vol. 21 no. 5)
pp. 468-475
In this paper we are concerned with the problem of determining the potential for load balancing in a distributed computing system. We define a precise measure, called the Number of Sharable Jobs, of this potential in terms of the number of jobs that can usefully be transferred across sites in the system. Properties of this measure are derived, including a general formula for its probability distribution, independent of any particular queuing discipline. A normalized version of the number of sharable jobs, called the Job Sharing Coefficient, is defined. From the general formula, the probability distribution of the number of sharable jobs is computed for three important queuing models and exact expressions are derived in two cases. For queuing models in which an exact expression for the probability distribution of the number of sharable jobs is difficult to obtain, two methods are presented for numerical computation of this distribution. The job sharing coefficient is plotted against traffic intensity for various values of system parameters. Both of these measures are shown to be useful analytic tools for understanding the characteristics of load sharing in distributed systems and can aid in the design of such systsems.

[1] I. Anderson,A First Course in Combinatorial Mathematics.Oxford: Clarendon, 1974
[2] D. Gross and C.M. Harris,Fundamentals of Queueing Theory, 2nd edition. New York: John Wiley&Sons, 1985.
[3] N. Kleinrock,Queuing Systems, vol. 1. New York: Jihn Wiley&Sons, 1976.
[4] M. Livny and M. Melman, "Load Balancing in Homogeneous Broadcast Distributed Systems," Proc. ACM Computer Network Performance Symp., pp. 47-55, 1982.
[5] A.M. Mood,F.A. Graybill,, and D.C. Boas,Introduction to the Theory of Statistics, 3rd ed. New York: McGraw Hill, 1974.
[6] C.G. Rommel,“The probability of load balancing success in ahomogeneous network,” IEEE Trans. Software Engineering, vol. 17, pp. 922-933, Sept. 1991.
[7] T.L. Saaty,Elements of Queuing Theory with Applications.New York: Dover, 1983.
[8] N.G. Shivaratri,P. Krueger,, and M. Singhal,“Load distributing in locally distributed systems,” IEEE Computer, vol. 25, pp. 33-44, Dec 1992.
[9] M.G. Sriram and M.G. Singhal., “Measures of load sharing potential indistributed computer systems,” Technical Report OSU-CISC-6/93-TR25, Dept.of Computer and Information Science,Ohio State University, Columbus, June 1993.
[10] M.G. Sriram., “Stochastic analysis of load imbalance in distributed computing systems,” PhD dissertation, Ohio State University, Dept. of Computer andInformation Science, Columbus, Mar. 1995.

Index Terms:
Load Sharing, distributed systems, sharable jobs, job sharing coefficient.
Citation:
M.g. Sriram, Mukesh Singhal, "Measures of the Potential for Load Sharing in Distributed Computing Systems," IEEE Transactions on Software Engineering, vol. 21, no. 5, pp. 468-475, May 1995, doi:10.1109/32.387476
Usage of this product signifies your acceptance of the Terms of Use.