CFP last date
22 April 2024
Reseach Article

K-Mean Clustering based Task Allocation Model for Distributed Real-Time System

by Urmani Kaushal, Avanish Kumar, Narendra Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Number 18
Year of Publication: 2014
Authors: Urmani Kaushal, Avanish Kumar, Narendra Kumar
10.5120/18479-8503

Urmani Kaushal, Avanish Kumar, Narendra Kumar . K-Mean Clustering based Task Allocation Model for Distributed Real-Time System. International Journal of Computer Applications. 105, 18 ( November 2014), 29-33. DOI=10.5120/18479-8503

@article{ 10.5120/18479-8503,
author = { Urmani Kaushal, Avanish Kumar, Narendra Kumar },
title = { K-Mean Clustering based Task Allocation Model for Distributed Real-Time System },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 105 },
number = { 18 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 29-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume105/number18/18479-8503/ },
doi = { 10.5120/18479-8503 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:38:04.860664+05:30
%A Urmani Kaushal
%A Avanish Kumar
%A Narendra Kumar
%T K-Mean Clustering based Task Allocation Model for Distributed Real-Time System
%J International Journal of Computer Applications
%@ 0975-8887
%V 105
%N 18
%P 29-33
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The distributed real-time system [DRTS] is the great platform for parallel application. Multiple tasks will be formed of the parallel application, which are to be allocated over the nodes available in DRTS. Numbers of tasks are much more than available nodes in the system. The tasks should be grouped or clustered in a very efficient manner and allocated over the nodes of the system efficiently for the minimization of overall system cost and maximization of system performance. Task allocation is NP-hard problem. A model based on k-mean clustering has been proposed in this paper. In the suggested model, the limitation of memory and the number of tasks allowed over the processor has been considered. MATLAB 7. 11. 0 has been used to simulate the proposed model.

References
  1. B. Ucara, C. Aykanata, K. Kayaa and M. Ikincib, "Task Assignment in heterogeneous computing system," J. Parallel Distrib. Comput. , vol. 66, pp. 32-46, 2006.
  2. P. -Y. RICHARD MA, E. Y. S. LEE and M. TSUCHIYA, "A Task Allocation Model for Distributed Computing Systems," IEEE Transactions on Computers, vol. C 31, no. 1, pp. 41-47, January 1982.
  3. A. Elsadek and B. E. Wells, "A Heuristic model for task allocation in heterogeneous distributed computing systems," The International Journal of Computers and Their Applications, vol. 6, no. 1, pp. 0-35, March 1999.
  4. K. Govil and A. Kumar, "A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment," International Journal of Computer Applications, vol. 23, no. 8, pp. 1-5, June 2011.
  5. U. Kaushal and A. Kumar, "Improving the Performance of DRTS by Optimal Allocation of Multiple Tasks under Dynamic Load Sharing Scheme," International Journal of Scientific & Engineering Research, vol. 4, no. 7, pp. 1316-1321, July 2013.
  6. U. Kaushal and A. Kumar, "Modified Clustered Approach for Performance Escalation of Distributed Real-Time System," in ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol II, S. C. Satapathy, P. Avadhani, S. K. Udgata and S. Kakshminarayana, Eds. , Vishakapatnam, Springer International Publishing, 2014, pp. 9-16.
  7. U. Kaushal and A. Kumar, "Performance Intensification of DRTS under Static Load Sharing Scheme," International Journal of Computer Applications, vol. 71, no. 16, pp. 55-59, June 2013.
  8. U. Kaushal. A. Kumar and N. Kumar, "Algorithm for Performance Improvement of DRTS Under Static Load Sharing Scheme," IUP Journal of Information Technology, vol. 9, no. 3, pp. 43-52, September 2013.
  9. H. S. Stone, "Multiprocessor scheduling with the aid of network flow," IEEE Trans. Software Eng. , vol. SE 3, pp. 85-93, January 1977.
  10. R. Mohan and N. P. Gopalan, "A Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System," I. J. Information Technology and Computer Science, vol. 5, no. 10, pp. 78-84, 2013.
  11. Karimi, F. Zarafshan and A. b. Jantan, "A New Fuzzy Approach for Dynamic Load Balancing Algorithm," International Journal of Computer Science and Information Security, vol. 6, no. 1, pp. 1-5, 2009.
  12. Sahu and R. Tapadar, "Solving the Assignment problem using Genetic Algorithm and Simulated Annealing," IAENG International Journal of Applied Mathematics, vol. 36, no. 1, pp. 762-765, February 2006.
  13. G. Attiya and Y. Hamam, "Task allocation for maximizing reliability of distributed systems:A simulated annealing approach," J. Parallel Distrib. Comput. , vol. 66, no. 10, p. 1259 – 1266, 2006.
  14. Z. Khan, R. Singh and R. Alam, "Tasks Allocation Using Fuzzy Inference in Parallel And Distributed System," Journal of Information and Operations Management, vol. 3, no. 2, pp. 322-326, 2012.
  15. K. Govil, "A Smart Algorithm for Dynamic Task Allocation for Distributed Processing Environment," International Journal of Computer Applications, vol. 28, no. 2, pp. 13-19, 2011.
  16. G. A. Geist and V. S. &Sunderam, "Concurrency: Practice and Experience," Network Based Concurrent Computing on the PVM System, vol. 4, no. 4, pp. 293-311, 1992.
  17. Folliot and P. Sens, "Load Sharing and Fault Tolerance Manager," High Performance Cluster Computing Architectures, p. 841, 2008.
  18. P. Yadav, M. Singh and K. Sharma, "An Optimal Task Allocation Model for System Cost Analysis in Hetrogeneous Distributed Computing Systems: A Heuristic Approach," International Journal of Computer Applications, vol. 28, no. 4, pp. 30-37, August 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Real Time System k-mean cluster NP-hard Parallel Application Task Allocation.