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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Intelligent Algorithm for proper Allocation of Tasks in Distributed Network

by Kapil Govil, Shilpi Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 174 - Number 24
Year of Publication: 2021
Authors: Kapil Govil, Shilpi Sharma
10.5120/ijca2021921154

Kapil Govil, Shilpi Sharma . An Intelligent Algorithm for proper Allocation of Tasks in Distributed Network. International Journal of Computer Applications. 174, 24 ( Mar 2021), 45-49. DOI=10.5120/ijca2021921154

@article{ 10.5120/ijca2021921154,
author = { Kapil Govil, Shilpi Sharma },
title = { An Intelligent Algorithm for proper Allocation of Tasks in Distributed Network },
journal = { International Journal of Computer Applications },
issue_date = { Mar 2021 },
volume = { 174 },
number = { 24 },
month = { Mar },
year = { 2021 },
issn = { 0975-8887 },
pages = { 45-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume174/number24/31825-2021921154/ },
doi = { 10.5120/ijca2021921154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:23:01.061316+05:30
%A Kapil Govil
%A Shilpi Sharma
%T An Intelligent Algorithm for proper Allocation of Tasks in Distributed Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 174
%N 24
%P 45-49
%D 2021
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A network is a set of devices, which are connected by media links. These devices may be called as nodes. A node can be computer, printer, or any other device, which may send and / or receive data generated by other node on the network. In distributed network, the task is divided among multiple modules and there are multiple processors so it looks like a virtual uniprocessor. The allocation of tasks in distributed network has an important role to the evaluation of the performance of these networks. This paper describes an efficient task allocation method for distributed network. It is based on the cost for the execution of the tasks to the various processors and also the communication amongst the tasks. In the almost all real world problem, the number of tasks is more than the number of processors of the distributed network.

References
  1. A. Farinelli, L. Iocchi, D. Nardi and V. A. Ziparo. 2005. Task Assignment with dynamic perception and constrained tasks in a Multi-Robot System. Proc. of International Conference on Robotics and Automation (ICRA'05).
  2. A. Y. Hamed. 2012. Task Allocation for Maximizing Reliability of Distributed Computing Systems Using Genetic Algorithms. International Journal of Computer Networks and Wireless Communications. 2 (5). 560 – 569.
  3. Bassel Arafeh, Khalid Day and Abderezak Touzene. 2008. A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems. Journal of Systems Architecture: The EUROMICRO Journal. 54 (5). 530 – 548.
  4. Bo Yang, Huajun Hu, Suchang Guo. 2009. Cost-oriented task allocation and hardware redundancy policies in heterogeneous distributed computing systems considering software reliability. Computers & Industrial Engineering, 56 (4), 1687 – 1696.
  5. Dorta, C. Leon, and C. Rodriguez. 2010. Performance analysis of Branch-and-Bound skeletons. Mathematical and Computer Modeling, 51 (3 – 4), 300 – 308.
  6. Ensink, Brian, Stanley, Joel and Adve, Vikram. 2003. Program Control Language: a programming language for adaptive distributed applications. Elsevier Inc., 63 (12), 1082 –1104.
  7. Faizul Navi Khan and Kapil Govil. 2014. A tricky task scheduling technique to optimize time cost and reliability in mobile computing environment. International Journal of Research in Engineering and Technology. 3 (5). 823 – 829.
  8. Faizul Navi Khan and Kapil Govil. 2014. A Static approach to optimize time cost and reliability in Distributed Processing Environment. International Journal of Scientific & Engineering Research. 5 (5). 1016 – 1021.
  9. Fitzgerald, Kent, Latifi, Shahram and Srimani, Pradip K. 2002. Reliability Modeling and Assessment of the Star-Graph Networks. IEEE Transactions on Reliability, 51, 49 – 57.
  10. Jihyun Park, Byoungju Choi and Seungyeun Jang. 2020. Dynamic Analysis Method for Concurrency Bugs in Multi-process/Multi-thread Environments. International Journal of Parallel Programming. 48. 1032 – 1060.
  11. Kumar Avanish, 2001. An Algorithm for Optimal Index to Tasks Allocation Based on Reliability and cost. Proceedings of International Conference on Mathematical Modeling, Roorkee. 150 – 155.
  12. Kumar, V. Singh, M. P. and Yadav, P. K. 1995. A Fast Algorithm for Allocating Tasks in Distributed Processing System. Proceedings of the 30th Annual Convention of CSI, Hyderabad. 347 – 358.
  13. Manisha Sharma, Harendra Kumar and Deepak Garg. 2012. An Optimal Task Allocation Model through Clustering with Inter – Processor Distances in Heterogeneous Distributed Computing Systems. International Journal of Soft Computing and Engineering. 2 (1). 50 – 55.
  14. Monika Choudhary and Sateesh Kumar Peddoju. 2012. A Dynamic Optimization Algorithm for Task Scheduling in Cloud Environment. International Journal of Engineering Research and Applications (IJERA). 2 (3). 2564 – 2568.
  15. Muhammad K. Dhodhi, Imtiaz Ahmad, Anwar Yatama and Ishfaq Ahmad. 2002. An Integrated Technique for Task Matching and Scheduling onto Distributed Heterogeneous Computing Systems. Elsevier Inc., 62(9), 1338 – 1361.
  16. Ormon, Stephen W., Cassady, C. Richard and Greenwood, Allen G. 2002. Reliability Prediction model to Support Conceptual Design, IEEE Transactions on Reliability, 51, 151 – 157.
  17. Ravindran, Binoy, Devarasetty, Ravi K. and Shirazi, Behrooz. 2002. Adaptive Resource Management Algorithms for Periodic Tasks in Dynamic Real-Time Distributed Systems. Elsevier Inc., 62 (10), 1527 – 1547.
  18. Shu Wanneng, Wang Jiangqing, Min – Min Chromosome. 2009. Genetic Algorithm for Load Balancing in Grid Computing. International journal of Distributed sensor network, 5(1), 62 – 63.
  19. V. Pilloni, P. Navaratnam, S. Vural, L. Atzori and R. Tafazolli. 2014. TAN: A Distributed Algorithm for Dynamic Task Assignment in WSNs. Sensors Journal, IEEE. 14 (4). 1266 – 1279.
  20. Wang Fan, Chen Ben, Miao Zhaowei. 2008. A Survey on Reviewer Assignment Problem. Book on new frontiers in applied artificial intelligence. 5027, 718 – 727.
  21. Zhengao, Dandamudi Sivarama P. 2009. An Adaptive Space-Sharing Policy for Heterogeneous Parallel Systems. Book on high performance computing and networking, 2110, 353 – 362.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Network Allocation Task Processor Communication

Powered by PhDFocusTM