Distributed computing has the potential for running large-scale applications using heterogeneous and geographically distributed resources. However, a number of major technical issues must be handled before the full potential of distributed computing can be realized. Efficient job scheduling is a major prerequisite for the effective utilization of resources. Dynamic load balancing is the core of an efficient job scheduler. This paper describes the features of a Java- based simulator intended to analyze the performance of three load balancing algorithms, namely: sender- initiated, receiver-initiated and symmetrically-initiated algorithms using Average Waiting Time (AWT) and Average Turnaround Time (ATT) as criteria. Simulation results revealed that the symmetrically- initiated algorithm performs better in almost all cases.
[1]
Peter M. A. Sloot,et al.
A dynamic load balancing system for parallel cluster computing
,
1996,
Future Gener. Comput. Syst..
[2]
Randy Chow,et al.
Distributed Operating Systems & Algorithms
,
1997
.
[3]
Uwe Schwiegelshohn,et al.
On the Design and Evaluation of Job Scheduling Algorithms
,
1999,
JSSPP.
[4]
Hongzhang Shan,et al.
Job Superscheduler Architecture and Performance in Computational Grid Environments
,
2003,
ACM/IEEE SC 2003 Conference (SC'03).
[5]
Srinivasan Parthasarathy,et al.
Customized dynamic load balancing for a network of workstations
,
1996,
Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing.