Task Scheduling of a Distributed Computing Software in the Presence of Faults

Performance estimation of a distributed software is a challenging problem. A distributed software runs on multiple processing nodes interconnected in some fashion. In such a situation computational load of a software is distributed onto the processing nodes of the given system. Such a system makes use of an appropriate task scheduling algorithm for obtaining a good performance. The program used in this work emulates a distributed system . An emulator gives the result like an actual system. The emulator is of a fully connected distributed system in which any two processors can directly communicate. The objective of this experiment is to identify the task scheduling algorithm that also performs well in the presence of communication fault delay occured because of network failure or computation fault delay occured because of no response from processors in a distributed system.

[1]  Audris Mockus,et al.  An Empirical Study of Speed and Communication in Globally Distributed Software Development , 2003, IEEE Trans. Software Eng..

[2]  Cyril Briquet,et al.  Reproducible testing of distributed software with middleware virtualization and simulation , 2008, PADTAD '08.

[3]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[4]  Yingxu Wang,et al.  A framework for testing distributed software components , 2005, Canadian Conference on Electrical and Computer Engineering, 2005..

[5]  Giovanni Denaro,et al.  Early performance testing of distributed software applications , 2004, WOSP '04.

[6]  Roger Ferguson,et al.  Generating test data for distributed software using the chaining approach , 1996, Inf. Softw. Technol..

[7]  Ingrid Jansch-Pôrto,et al.  Modeling communication delays in distributed systems using time series , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[8]  Yedidyah Langsam,et al.  Data structures using C and C , 1989 .

[9]  Raul Ceretta,et al.  Modeling Communication Delays in Distributed Systems using Time Series , 2002 .

[10]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[11]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[12]  Vilas M. Thakare,et al.  Technical Computation and Communication Delay in Distributed System , 2011 .

[13]  Keqin Li,et al.  Scheduling parallel tasks on multiprocessor computers with efficient power management , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[14]  Pramod Kumar Mishra,et al.  A CLUSTERING HEURISTIC FOR MULTIPROCESSOR ENVIRONMENTS USING COMPUTATION AND COMMUNICATION LOADS OF MODULES , 2010 .

[15]  Yedidyah Langsam,et al.  Data structures using C and C++ (2nd ed.) , 1996 .

[16]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[17]  Pramod Kumar Mishra,et al.  Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules , 2012 .

[18]  Alexey L. Lastovetsky.  Parallel testing of distributed software , 2005, Inf. Softw. Technol..

[19]  Krithi Ramamritham,et al.  Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems , 1985, IEEE Transactions on Computers.