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; 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.
[1] Tel, G., Introduction to Distributed Process Scheduling. 1998,
University of Cambridge..
[2] Chow, R. and T. Johnson, Distributed Operating Systems and Algorithms. 1997: Addison-Wesley.
[3] Ramamritham, K. and J.A. Stankovic, Dynamic Task Scheduling in
Hard Real-Time Distributed Systems. IEEE Software, 2002. 1(3): p. 65-75.
[4] Audsley, N. and A. Burns, Real -Time Scheduling, in Department of
Computer Science. 1994, University of York.
[5] Boger, M., Java in Distributed Systems. 2001: Wiley.
[6] Malik, S., Dynamic Load Balancing in a Network Workstations. 2003:
Prentice-Hall.
[7] Stankovic, J.A., Simulations of three adaptive, decentralized controlled,
job scheduling algorithms. Computer Networks, 1999. 8(3): p. 199-217.
[8] Chaptin, S.J., Distributed and Multiprocessor Scheduling. 2003,
University of Minnesota.
[9] Audsley, N., Scheduling Hard Real-Time Systems. 2000.
[10] Eager, D.L., E.D. Lazowska, and J. Zahorjan, A Comparison of
Receiver-Initiated and Sender-Initiated Adaptive Load Sharing. 1985,
University of Washington.
[11] Dandamudi, S.P. The Effect of Scheduling Discipline on Dynamic Load
Sharing in Heterogeneous Distributed Systems. in IEEE Int. Symp. on
Modeling, Analysis and Simulation of Computer and
Telecommunication Systems (MASCOTS). 1997. Haifa, Israel.
[12] Dandamudi, S.P., The Effect of Scheduling Discipline on Sender-
Initiated and Receiver-Initiated Adaptive Load Sharing in Homogeneous
Distributed Systems. 1995, Carleton University.
[13] Dandamudi, S.P., Sensitivity evaluation of dynamic load sharing in
distributed systems. Concurrency, IEEE, 1998. Volume 6(3): p. 62 - 72.
[14] Dikshit, P., S.K. Tripathi, and P. Jalote, SAHAYOG: A Test Bed for
Evaluating Dynamic Load--Sharing Policies. Software -- Practise and
Experience, 1989. 5: p. 411-435.
[15] Svensson, A. Dynamic alternation between receiver-initiated and senderinitiated
load sharing. in International Conference on Databases, Parallel
Architectures and Their Applications (PARBASE-90). 1990.
[16] Dandamudi, S.P. and H. Hadavi. Performance Impact of I/O on Sender
Initiated and Receiver Initiated Adaptive Load Sharing in Distributed
Systems. in Int. Conf. Parallel and Distributed Computing Systems.
1996. Dijon, France.
[17] Kremien, O. and J. Kramer, Methodical analysis of adaptive load sharing
algorithms. Parallel and Distributed Systems, IEEE Transactions on,
1992. 3(6): p. 747-760.
[18] Shivaratri, N.G. and P. Krueger. Two Adaptive Location Policies for
Global Scheduling Algorithms. in IEEE International Conference on
Distributed Computing Systems (ICDCS). 1990.
[19] Krueger, P., Distributed Scheduling for a Changing Environment. 1988,
University of Wisconsin-Madison.
[20] Mirchandaney, R., D. Towsley, and J.A. Stankovic, Analysis of the
effects of delays on load sharing. Computers, IEEE Transactions on,
1989. 38(11): p. 1513 - 1525.
[21] Antonis, K., J.D. Garofalakis, and P.G. Spirakis. A Competitive
Symmetrical Transfer Policy for Load Sharing. in Proceedings of the 4th
International Euro-Par Conference on Parallel Processing. 1998.
[22] Dasgupta, P., A.K. Majumder, and P. Bhattacharya, V_THR: An
Adaptive Load--Balancing Algorithm. Journal of Parallel and
Distributed Computing. 42(2): p. 101-108.
[23] K. Benmohammed-Mahieddine and P. M. Dew, A Periodic
Symmetrically-Initiated Load Balancing Algorithm for Distributed
Systems, ACM SIGOPS Operating Systems Review, Vol. 28, No. 1,
1994, pp. 66--79.
[24] Y.T. Wang and R.J.T. Morris, Load Sharing in Distributed System
[1] Tel, G., Introduction to Distributed Process Scheduling. 1998,
University of Cambridge..
[2] Chow, R. and T. Johnson, Distributed Operating Systems and Algorithms. 1997: Addison-Wesley.
[3] Ramamritham, K. and J.A. Stankovic, Dynamic Task Scheduling in
Hard Real-Time Distributed Systems. IEEE Software, 2002. 1(3): p. 65-75.
[4] Audsley, N. and A. Burns, Real -Time Scheduling, in Department of
Computer Science. 1994, University of York.
[5] Boger, M., Java in Distributed Systems. 2001: Wiley.
[6] Malik, S., Dynamic Load Balancing in a Network Workstations. 2003:
Prentice-Hall.
[7] Stankovic, J.A., Simulations of three adaptive, decentralized controlled,
job scheduling algorithms. Computer Networks, 1999. 8(3): p. 199-217.
[8] Chaptin, S.J., Distributed and Multiprocessor Scheduling. 2003,
University of Minnesota.
[9] Audsley, N., Scheduling Hard Real-Time Systems. 2000.
[10] Eager, D.L., E.D. Lazowska, and J. Zahorjan, A Comparison of
Receiver-Initiated and Sender-Initiated Adaptive Load Sharing. 1985,
University of Washington.
[11] Dandamudi, S.P. The Effect of Scheduling Discipline on Dynamic Load
Sharing in Heterogeneous Distributed Systems. in IEEE Int. Symp. on
Modeling, Analysis and Simulation of Computer and
Telecommunication Systems (MASCOTS). 1997. Haifa, Israel.
[12] Dandamudi, S.P., The Effect of Scheduling Discipline on Sender-
Initiated and Receiver-Initiated Adaptive Load Sharing in Homogeneous
Distributed Systems. 1995, Carleton University.
[13] Dandamudi, S.P., Sensitivity evaluation of dynamic load sharing in
distributed systems. Concurrency, IEEE, 1998. Volume 6(3): p. 62 - 72.
[14] Dikshit, P., S.K. Tripathi, and P. Jalote, SAHAYOG: A Test Bed for
Evaluating Dynamic Load--Sharing Policies. Software -- Practise and
Experience, 1989. 5: p. 411-435.
[15] Svensson, A. Dynamic alternation between receiver-initiated and senderinitiated
load sharing. in International Conference on Databases, Parallel
Architectures and Their Applications (PARBASE-90). 1990.
[16] Dandamudi, S.P. and H. Hadavi. Performance Impact of I/O on Sender
Initiated and Receiver Initiated Adaptive Load Sharing in Distributed
Systems. in Int. Conf. Parallel and Distributed Computing Systems.
1996. Dijon, France.
[17] Kremien, O. and J. Kramer, Methodical analysis of adaptive load sharing
algorithms. Parallel and Distributed Systems, IEEE Transactions on,
1992. 3(6): p. 747-760.
[18] Shivaratri, N.G. and P. Krueger. Two Adaptive Location Policies for
Global Scheduling Algorithms. in IEEE International Conference on
Distributed Computing Systems (ICDCS). 1990.
[19] Krueger, P., Distributed Scheduling for a Changing Environment. 1988,
University of Wisconsin-Madison.
[20] Mirchandaney, R., D. Towsley, and J.A. Stankovic, Analysis of the
effects of delays on load sharing. Computers, IEEE Transactions on,
1989. 38(11): p. 1513 - 1525.
[21] Antonis, K., J.D. Garofalakis, and P.G. Spirakis. A Competitive
Symmetrical Transfer Policy for Load Sharing. in Proceedings of the 4th
International Euro-Par Conference on Parallel Processing. 1998.
[22] Dasgupta, P., A.K. Majumder, and P. Bhattacharya, V_THR: An
Adaptive Load--Balancing Algorithm. Journal of Parallel and
Distributed Computing. 42(2): p. 101-108.
[23] K. Benmohammed-Mahieddine and P. M. Dew, A Periodic
Symmetrically-Initiated Load Balancing Algorithm for Distributed
Systems, ACM SIGOPS Operating Systems Review, Vol. 28, No. 1,
1994, pp. 66--79.
[24] Y.T. Wang and R.J.T. Morris, Load Sharing in Distributed System
@article{"International Journal of Information, Control and Computer Sciences:56250", author = "Nazleeni Samiha Haron and Anang Hudaya Muhamad Amin and Mohd Hilmi Hasan and Izzatdin Abdul Aziz and Wirdhayu Mohd Wahid", title = "Time Comparative Simulator for Distributed Process Scheduling Algorithms", abstract = "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.", keywords = "Distributed Systems, Load Sharing, Process Scheduling, AWT and ATT", volume = "2", number = "7", pages = "2406-6", }
