%0 Journal Article
	%A Nazleeni Samiha Haron and  Anang Hudaya Muhamad Amin and  Mohd Hilmi Hasan and  Izzatdin Abdul Aziz and  Wirdhayu Mohd Wahid
	%D 2008
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 19, 2008
	%T Time Comparative Simulator for Distributed Process Scheduling Algorithms
	%U https://publications.waset.org/pdf/7174
	%V 19
	%X 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; senderinitiated,
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.
	%P 2550 - 2555