Time Comparative Simulator for Distributed Process Scheduling Algorithms

In any distributed systems, process scheduling plays a vital role in determining the efficiency of the system. Process scheduling algorithms are used to ensure that the components of the system would be able to maximize its utilization and able to complete all the processes assigned in a specified period of time. This paper focuses on the development of comparative simulator for distributed process scheduling algorithms. The objectives of the works that have been carried out include the development of the comparative simulator, as well as to implement a comparative study between three distributed process scheduling algorithms; sender- initiated, receiver-initiated and hybrid sender-receiver-initiated algorithms. The comparative study was done based on the Average Waiting Time (AWT) and Average Turnaround Time (ATT) of the processes involved. The simulation results show that the performance of the algorithms depends on the number of nodes in the system.

[1]  Sivarama P. Dandamudi.  The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[2]  Jeff Kramer,et al.  Methodical Analysis of Adaptive Load Sharing Algorithms , 1992, IEEE Trans. Parallel Distributed Syst..

[3]  Sivarama P. Dandamudi,et al.  Performance Impact of I/O on Sender-Initia ted and Receiver-Initiated Load Sharing Policies in Distributed Systems , 1996 .

[4]  Yung-Terng Wang,et al.  Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.

[5]  John A. Stankovic,et al.  Simulations of Three Adaptive, Decentralized Controlled, Job Scheduling Algorithms , 1984, Comput. Networks.

[6]  Steve J. Chapin,et al.  Distributed and multiprocessor scheduling , 1996, CSUR.

[7]  Donald F. Towsley,et al.  Analysis of the Effects of Delays on Load Sharing , 1989, IEEE Trans. Computers.

[8]  Peter M. Dew,et al.  A periodic symmetrically-initiated load balancing algorithm for distributed systems , 1994, OPSR.

[9]  Venansius Baryamureeba,et al.  PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 8 , 2005 .

[10]  Krithi Ramamritham,et al.  Dynamic Task Scheduling in Hard Real-Time Distributed systems , 1984, IEEE Software.

[11]  A. Burns,et al.  Scheduling hard real-time systems: a review , 1991, Softw. Eng. J..

[12]  BurnsA..  Scheduling hard real-time systems , 1991 .

[13]  A. Svensson.  Dynamic alternation between receiver-initiated and sender-initiated load sharing , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[14]  Randy Chow,et al.  Distributed Operating Systems & Algorithms , 1997 .

[15]  Phillip E. Krueger.  Distributed scheduling for a changing environment , 1988 .

[16]  Sivarama P. Dandamudi.  The Effect of Scheduling Discipline on Sender-Initia ted and Receiver-Initiated Adaptive Load Sharing in Homogeneous Distributed Systems† , 1995 .

[17]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.

[18]  Satish K. Tripathi,et al.  SAHAYOG: A test bed for evaluating dynamic load‐sharing policies , 1989, Softw. Pract. Exp..

[19]  Sivarama P. Dandamudi.  Sensitivity evaluation of dynamic load sharing in distributed systems , 1998, IEEE Concurr..

[20]  Phillip Krueger,et al.  Two adaptive location policies for global scheduling algorithms , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[21]  Paul G. Spirakis,et al.  A Competitive Symmetrical Transfer Policy for Load Sharing , 1998, Euro-Par.

[22]  Pallab Dasgupta,et al.  V_THR: An Adaptive Load Balancing Algorithm , 1997, J. Parallel Distributed Comput..