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

An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System

by Pankaj Saxena, Kapil Govil
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 5
Year of Publication: 2013
Authors: Pankaj Saxena, Kapil Govil
10.5120/14114-2163

Pankaj Saxena, Kapil Govil . An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System. International Journal of Computer Applications. 82, 5 ( November 2013), 30-34. DOI=10.5120/14114-2163

@article{ 10.5120/14114-2163,
author = { Pankaj Saxena, Kapil Govil },
title = { An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 5 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 30-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number5/14114-2163/ },
doi = { 10.5120/14114-2163 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:57:00.381344+05:30
%A Pankaj Saxena
%A Kapil Govil
%T An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 5
%P 30-34
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Distributed computing refers to the use of distributed systems to solve computational problems. A distributed computing system consists of multiple computers that communicate through a computer network. The computers that are in a distributed computing system can be physically close together and connected by a local network, or they can be geographically distant and connected by a wide area network. Distributed computing systems offer the benefits like scalability and redundancy. A task is any single module to be processed. If the number of tasks are more then the number of processors and every processor process the task in a particular time period for processing any particular task then we have to allocate each task to the single processor in such a way that the task should be completed in a optimal reliability manner and also there should not be overloading of task to any single processor. The number of processors and number of tasks are static in nature. The number of processors is denoted by n and the number of tasks is denoted by m. In general for all real world problem the number of tasks are greater then the number of processors i. e. m>n. The requirement is to complete all the tasks by allocating the task so that the results for reliability should be optimal in nature to increase the overall performance of distributed computing system.

References
  1. Anil Kumar tripathi,deo prakash vidyarthi,A. N. mantri, "a genetic task allocation algorithm for distributed computing systems incorporating problem specific knowledge", international journal of high speed computing,vol:8, issue:4, pp:363-370.
  2. Asaduzzaman Shah, Maheswaran Muthucumaru, "Decentralized management of bi-modal network resources in a distributed stream processing platform", Journal of Parallel and Distributed Computing, vol: 71, issue 6, pp: 774-787, 2011.
  3. Anurag raii, vikram kapoor, Reliable Clustering Model for Enhancing Processors Throughput in Distributed Computing System, international journal of computer applications, vol:38, issue:8, pp:0975-8887, 2012.
  4. Ashish chandak, bibhodatta sahoo, ashok kumar turuk, "Task Scheduling Heuristic in Grid Computing, International Journal of Computer Applications and Technology" ,vol:1, issue:2, pp:49-52, 2012.
  5. Bibhudatta Sahoo, Dilip Kumar, Sanjay Kumar Jena, "Analysing the Impact of Heterogeneity with Greedy Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System", International Journal of Computer Applications, vol:62, issue:19, pp:25-34, 2013.
  6. Dr. Kapil Govil, and Dr. Avanish Kumar, "A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment," International Journal of Computer Applications, vol. 23, pp. 0975 – 8887, June 2011.
  7. Dr. Kapil Govil, "Processing Reliability based a Clever Task Allocation Algorithm to Enhance the Performance of Distributed Computing Environment," Int. J. Advanced Networking and Applications, vol. 03, pp. 1025-1030, 2011.
  8. G. sagar, anil K, sarj E, "Task allocation model for distributed systems", International Journal of Systems Science, vol: 22, issue: 9, pp: 1671-1678, 1991.
  9. H. J. Siegel, S. Ali, Techniques for mapping tasks to nodes in heterogeneous computing Systems, Journal of Systems Architecture,vol:46, issue:8, pp:627-639, 2000.
  10. Hsieh, Chung-Chi, Hsieh, Yi-Che, "Reliability and cost optimization in distributed computing systems", journal of Computers & Operations Research, vol: 30, issue: 8, pp: 1103-1119, 2003.
  11. Iqbinderpal Singh, Maninder Singh, Cloud Service Allocation based on Service Effectiveness and User Requirement, international journal of emerging trends and technology in computer science, vol:2, issue:1, pp:190-193, 2013.
  12. I. stephie Rachel, Joshua Samuel raj, v. vasudevan, A Reliable Schedule with Budget Constraints in Grid Computing, international journal of computer applications, vol:64, issue:3, pp:0975-8887, 2013.
  13. Ko?odziej Joanna, Xhafa Fatos, "Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids", International Journal of Applied Mathematics and Computer Science, vol: 21, issue: 2, pp: 243–257, 2007.
  14. Lantao Liu, Dylan Shell, A New Distributable Assignment Algorithm, 2013.
  15. Marwa shouman, gamal attiya, ibrahim Z. morsi, Static Workload Distribution of Parallel Applications in Heterogeneous Distributed Computing Systems with Memory and Communication Capacity Constraints, international journal of computer applications, vol:34, issue:6, pp:0975-8887, 2011.
  16. Mohammad I. Daouda, Nawwaf Kharma, A hybrid heuristic–genetic algorithm for task scheduling in heterogeneous processor networks, Journal of Parallel and Distributed Computing, vol:71, pp:1518-1531, 2011.
  17. Mostapha zbakh, said el hajji, "Task allocation problem as a non cooperative game", Journal of Theoretical and Applied Information Technology, vol: 16, issue: 2, pp: 110-115, 2010.
  18. Manisha Sharma, Harendra Kumar, Deepak Garg, "An Optimal Task Allocation Model through Clustering with Inter-Processor Distances in Heterogeneous Distributed Computing Systems", International Journal of Soft Computing and Engineering, vol: 2, issue: 1, pp: 50-55, 2012.
  19. Pankaj Saxena, Kapil Govil, An Optimized Algorithm for Enhancement of Performance of Distributed Computing System, International Journal of Computer Applications, Volume 64, issue:. 2, PP:37-42, 2013.
  20. Pradeep Kumar Yadav, M. P. Singh, Kuldeep Sharma, "Task Allocation Model for Reliability and Cost optimization in Distributed Computing System", International Journal of modeling, simulation and scientific computations, vol: 2, issue:2, pp. 1-19,2011.
  21. Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te Wang , "Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization" , Journal of Systems and Software, vol:80, issue: 5, pp: 724-735, 2007.
  22. Qin-Ma Kang, Hong He, Hui-Min Song, Rong Deng, "Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization", Journal of Systems and Software, vol: 83, issue: 11, , pp: 2165–2174, 2010.
  23. Sa meng, yanping xiang, huijuan fan, shengji yu, maximal profit service task partition and allocation in computer grid considering service reliability and security, journal of theoretical and applied information technology,vol:50, issue:1, pp:260-268.
  24. S. F. El-Zoghdy, M. Nofal, M. A. Shohla, A. El-sawy, An Efficient Algorithm for Resource Allocation in Parallel and Distributed Computing Systems, International Journal of Advanced Computer Science and Applications, vol: 4, issue: 2, pp:251-259, 2013.
  25. Sol M. Shatz, Jia-Ping Wang, Masanori Goto, "Task Allocation for Maximizing Reliability of Distributed Computer Systems", IEEE Transactions on Computers, Vol: 41 issue :9, pp: 1156-1168 , 1992.
  26. Santhanam Srinivasan, Niraj K. Jha, "Safety and Reliability Driven Task Allocation in Distributed Systems", IEEE Transactions on Parallel and Distributed Systems, vol: 10 issue: 3, pp: 238-251, 1999.
  27. Tejinder Sharma, Vijay Kumar Banga, Efficient and Enhanced Algorithm in Cloud Computing, International Journal of Soft Computing and Engineering, vol: 3, issue: 1, pp:385-390, 2013.
  28. Vivekananth. P, Eigen Trust Algorithm for Resource Selection in Grid Computing, International Journal of Computer Applications, vol: 16, issue: 4, pp: 50-54, 2011.
  29. Vidyarthi D. P, Tripathi A. K, "Maximizing reliability of distributed computing system with task allocation using simple genetic algorithm", journal of system architecture, vol: 47, issue: 6, pp. 549-554, 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Computing System Task Processor Task allocation.

Powered by PhDFocusTM