CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

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

by Kamal Sheel Mishra, Anil Kumar Tripathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 72 - Number 13
Year of Publication: 2013
Authors: Kamal Sheel Mishra, Anil Kumar Tripathi
10.5120/12551-8925

Kamal Sheel Mishra, Anil Kumar Tripathi . Task Scheduling of a Distributed Computing Software in the Presence of Faults. International Journal of Computer Applications. 72, 13 ( June 2013), 1-9. DOI=10.5120/12551-8925

@article{ 10.5120/12551-8925,
author = { Kamal Sheel Mishra, Anil Kumar Tripathi },
title = { Task Scheduling of a Distributed Computing Software in the Presence of Faults },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 72 },
number = { 13 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume72/number13/12551-8925/ },
doi = { 10.5120/12551-8925 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:37:47.907906+05:30
%A Kamal Sheel Mishra
%A Anil Kumar Tripathi
%T Task Scheduling of a Distributed Computing Software in the Presence of Faults
%J International Journal of Computer Applications
%@ 0975-8887
%V 72
%N 13
%P 1-9
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Anil Kumar Tripathi, P. K. Mishra, Abhishek Mishra,Kamal sheel Mishra, Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules, Elsevier Applied Mathematical Modelling 36 (2012) 6243-6263.
  2. Alexey Lastovetsky, Parallel testing of Distributed Software, Elsevier Information and Software technology Vol 47 (2005) 657-662.
  3. Cyril Briquet, Reproducible testing of Distributed software with middleware virtualization and simulation, ACM (2008).
  4. Giovanni denaro, Andrea polini, Wolfgang Emmerich, Early performance testing of distributed software applications, ACM (2004).
  5. james D. Herbsleb, Audris Mockus, An Empirical study of speed and communication in globally distributed software development, IEEE transactions on software enginering Vol 29 no. 6 (2003) june 481-494.
  6. raul cretta nunes, Ingrid jansch-porto, Modeling communication delays in distributed systems using time series, IEEE transactions (2002) 268-273.
  7. Yizheng yao, Yingxu Wang, A framework for testing distributed software components, IEEE transactions (2005) 1566-1569.
  8. Roger Ferguson, Bogdan Korel, Generating test data for distributed software using the chaining approach, Elsevier Information and software technology Vol 38 (1996) 343- 353.
  9. Carl K. Chang, Cheng-Chung Song,Rong-Fa Wang, distributed Software Testing with Specification, IEEE 1990.
  10. Y. K. Kwok, I. Ahmad, Benchmarking and comparison of the task graph scheduling algorithms, Journal of Parallel and Distributed Computing 59 (1999) 381–422.
  11. Kequin Li, Scheduling parallel tasks on multiprocessor computers with efficient power management, IEEE transactions (2010) 978-1-4244-6534, New York, USA.
  12. john A. Stankovic, K. Ramamritham, S. Cheng, Evaluation of a Flexible task scheduling algorithm for distributed hard real time systems, IEEE Transactions on Computers Vol c- 34 , no. 12 (1985) 1130–1143.
  13. V. S. Tondre, V. M. Thakare, S. S. Sherekar, R. V. Dharaskar, Technical computation and communication delay in distributed system, NCICT (2011) IJCA.
  14. R. C. Nunes,I. J. Porto, Modeling communication delays in distributed systems using time series, IEEE transactions (2002) 1060-9857/02, Brazil.
  15. P. K. Mishra, K. S. Mishra, A. Mishra, A clustering heuristic for multiprocessor environments using computation and communication loads of modules, International Journal of Computer Science & Information Technology, 2(5):170– 182, 2010.
  16. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, 2001.
  17. E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, W. H. Freeman and Co. , 1978.
  18. Y. Langsam, M. J. Augenstein, A. M. Tenenbaum, Data Structures Using C and C++, 2nd edition, Prentice Hall, 1996.
Index Terms

Computer Science
Information Sciences

Keywords

Clustering distributed computing homogeneous systems scheduling task allocation

Powered by PhDFocusTM