Effective Destination Decision Policies for Dynamic Load Balancing in Distributed Computer Systems with Star Topology


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 5, pp. 768-776, Sep. 1995
10.3745/KIPSTE.1995.2.5.768,   PDF Download:

Abstract

In a distributed computer system with star topology, the processing power of central node may be greater than that of peripheral nodes and the job arrival rate of each node may be different. The performance of load balancing may be very different according to the selection of sender criteria and receiver criteria for job transfer. But the optimal decision of sender and receiver criteria is very difficult in heterogeneous distributed computer systems. In this paper we propose effective destination decision policies using dynamic criteria such as mean job response time of a node and estimated response time of a job, instead of fixed threshold for dynamic load balancing.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. K. Soo, K. C. Gun, H. S. Young, "Effective Destination Decision Policies for Dynamic Load Balancing in Distributed Computer Systems with Star Topology," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 5, pp. 768-776, 1995. DOI: 10.3745/KIPSTE.1995.2.5.768.

[ACM Style]
Lim Kyung Soo, Kim Chong Gun, and Ha Sung Young. 1995. Effective Destination Decision Policies for Dynamic Load Balancing in Distributed Computer Systems with Star Topology. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 5, (1995), 768-776. DOI: 10.3745/KIPSTE.1995.2.5.768.