Notification: Our email services are now fully restored after a brief, temporary outage caused by a denial-of-service (DoS) attack. If you sent an email on Dec 6 and haven't received a response, please resend your email.
CFP last date
20 December 2024
Reseach Article

Weight based Task Assignment Model to Tolerate Faults in Heterogeneous Distributed Systems

by Shubhinder Kaur, Gurpreet Kaur
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 125 - Number 9
Year of Publication: 2015
Authors: Shubhinder Kaur, Gurpreet Kaur
10.5120/ijca2015905627

Shubhinder Kaur, Gurpreet Kaur . Weight based Task Assignment Model to Tolerate Faults in Heterogeneous Distributed Systems. International Journal of Computer Applications. 125, 9 ( September 2015), 25-28. DOI=10.5120/ijca2015905627

@article{ 10.5120/ijca2015905627,
author = { Shubhinder Kaur, Gurpreet Kaur },
title = { Weight based Task Assignment Model to Tolerate Faults in Heterogeneous Distributed Systems },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 125 },
number = { 9 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume125/number9/22460-2015905627/ },
doi = { 10.5120/ijca2015905627 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:15:35.149988+05:30
%A Shubhinder Kaur
%A Gurpreet Kaur
%T Weight based Task Assignment Model to Tolerate Faults in Heterogeneous Distributed Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 125
%N 9
%P 25-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Distributed frameworks play a critical part on accomplishing superior performance and better system utilization. The objective of a task allocation framework is to productively deal with the disseminated computing power of workstations, servers, and supercomputers keeping in mind the end goal to expand work throughput and system utilization. There are many issues of distributed computing system which are discussed in this paper in brief. This paper focuses on task assignment which in turn emphasizes on fault tolerance and recovery from fault with less processing time. The proposed algorithm assigns tasks to other nodes only when candidate node moves from its original position. The major area of concern in this architecture is task scheduling, if one slave node fails the task allocated by master node will not be completed and this situation is considered as fault. In this paper, we have exchanged views about a method which serves to lessen faults of the system and increase performance of the system.

References
  1. Zhongkui Li and Zhisheng Duan, “Distributed tracking control of multi agent systems with heterogeneous uncertainties”, International Conference on control and Automation, Hangzhou, pp. 1956-1961, 2013.
  2. Sreedevi R.N, Geeta U.N, U.P.Kulkarni , A.R.Yardi, “Enhancing Mobile Agent Applications with Security and Fault Tolerant Capabilities”, International advance Computing Conference, pp. 992-996, 2009.
  3. Asma Insaf Djebbar, Ghalem Belalem , “Modeling by groups for faults tolerance based on multi agent systems”, International conference on machine and web intelligence, pp.35-40, 2010.
  4. A. Y. Hamed, “Task Allocation for Maximizing Reliability of Distributed Computing Systems Using Genetic Algorithms”, International Journal of computer networks and wireless communications (IJCNWC), 2012.
  5. P K Yadav, M P Singh and Kuldeep Sharma, “An Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach”, International Journal of computer applications, pp. 30-37, 2011.
  6. Shilpa Gambhir ,Er. Sonia Goyal, “Reliable Task Allocation in Distributed Mobile Computing System with random node movement: Replication and Load Sharing Approach”, International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) 2014.
  7. Qin&Ma Kng, Hong He, Hui& Min Song, Rong Deng, “Task allocation for maximizing Reliability of distributed Computing System using Honeybee mating Optimization” ,The Journal of Systems and software, 2010.
  8. A.A. Elsadek & B. E. Wells, “A heuristic model for task allocation in heterogeneous distributed computing systems,” International journal of computers and their applications, pp. 1-35, 1999.
  9. V.M. Lo, “Heuristic Algorithms for Task assignment in distributed systems,” IEEE Transactions on computers, pp. 1384-1397, 2010.
  10. Vinod Kumar Yadav, Mahendra Pratap Yadav and Dharmendra Kumar Yadav, “Reliable Task allocation in heterogeneous distributed system with random node failure: Load sharing approach”, International conference on computing sciences, pp. 187-192, 2012.
  11. S. Ghosh, R. Melhem, D. Mosse, “Fault-tolerance through scheduling of a periodic tasks in hard real-time multiprocessor systems”, IEEE Transactions on Parallel and Distributed Systems, pp.272-284, 1997.
  12. G. Rodrıguez, M. J. Martın, P. Gonzalez, and J. Tourino, “Controller/Precompiler for Portable Checkpointing”, IEICE Transactions on Information and Systems, pp.408–417, 2006.
  13. Yung- Terng Wang, Robert J.T. Morris, ”Load sharing in distributed systems”, IEEE Transactions on computers, pp 204-217,1985.
  14. Fouzi Semchedine, Louiza Bouallouche-Medjkoune, Djamil Aissani, “Task Assignment policies in distributed server systems: A survey”, Journal of network and Computer Applications, pp. 1123-1129, 2011.
  15. Sanjay Bansal, Sanjeev Sharma, Ishita Trivedi, “A detailed review of fault- tolerance techniques in Distributed System”, IJIDCS, pp. 33-37.
  16. George Coulouris, Jean Dollimore, Tim Kindberg Gordon Blair, “Distributed systems- concepts and design”, Fifth edition, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed systems Task allocation job scheduling and scalability.