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

A Clustering Approach for Task Assignment Problem

by Vinay Kumar, P. C. Saxena, C. P. Katti
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 7
Year of Publication: 2012
Authors: Vinay Kumar, P. C. Saxena, C. P. Katti
10.5120/7204-9987

Vinay Kumar, P. C. Saxena, C. P. Katti . A Clustering Approach for Task Assignment Problem. International Journal of Computer Applications. 47, 7 ( June 2012), 46-49. DOI=10.5120/7204-9987

@article{ 10.5120/7204-9987,
author = { Vinay Kumar, P. C. Saxena, C. P. Katti },
title = { A Clustering Approach for Task Assignment Problem },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 7 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 46-49 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number7/7204-9987/ },
doi = { 10.5120/7204-9987 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:41:18.563457+05:30
%A Vinay Kumar
%A P. C. Saxena
%A C. P. Katti
%T A Clustering Approach for Task Assignment Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 7
%P 46-49
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The problem of task assignment in heterogeneous computing system has been studied for many years with many versions. We consider the problem in which tasks are to be assigned to homogeneous and heterogeneous machines to minimize the sum of the total computation and communication costs. In this paper, we introduce a novel algorithm to solve task assignment problem. It optimizes the assignment of cluster according to the storage and load balancing constraints and converts task assignment problem into a linear programming problem under the constraints of memory availability and load balancing on each machine. The aim of this work is to increase throughput, maximize resource utilization and fulfillment of user requirements.

References
  1. Foster I and Kesselman C (editors), (1999), The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA.
  2. M. M. Eshaghian, ed. , Heterogeneous Computing, Artech House, Norwood, MA, 1996.
  3. A. Khokhar, V. K. Prasanna, M. Shaaban, and C. L Wang, ''Heterogeneous computing: Challenges and opportunities,'' IEEE Computer, Vol. 26, No. 6, June 1993, pp. 18-27.
  4. H. J. Siegel, J. K. Antonio, R. C. Metzger, M. Tan, and Y. A. Li, ''Heterogeneous computing,'' in Parallel and Distributed Computing Handbook, A. Y. Zomaya, ed. , McGraw-Hill, New York, NY, 1996, pp. 725-761.
  5. H. J. Siegel, H. G. Dietz, and J. K. Antonio, ''Software support for heterogeneous computing,'' in The Computer Science and Engineering Handbook, A. B. Tucker, Jr. , ed. , CRC Press, Boca Raton, FL, 1997, pp. 1886-1909.
  6. Braun R, Siegel H, Beck N, Boloni L, Maheswaran M, Reuther A, Robertson J, Theys M, Yao B, Hensgen D and Freund R, (2001), A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, International Journal of Parallel and Distributed Computing, Vol. 61(6): 810-837.
  7. Maheswaran M, Ali S, Siegel H. J, Hensgen D. and Freund R. F,(1999), Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems, International Journal of Parallel and Distributed Computing,Vol. 59(2):107-131.
  8. Casanova H, Legrand A, Zagorodnov D and Berman F,(2000), Heuristics for Scheduling Parameter Sweep Applications in Grid Environments, In. Proc. Of the 9th heterogeneous Computing Workshop: 349-363, Cancun,Mexico.
  9. Stone H S, (1977), Multiprocessor Scheduling with the aid of network flow algorithms, IEEE Trans. Software Eng. 3:85-93.
  10. Stone H S, Bukhara S H,(1978), Control of distributed Processes, Computer: 97-106.
  11. Rewini H. E, Lewis T, and Ali H, (1994), Task Scheduling in Parallel and Distributed Systems, ISBN: 0130992356, PTR Prentice Hall.
  12. Hinma Kang, Hong He and Hui-Min Song, "Task Assignment in hetrogeneous computing systems using an effective iterated greedy algorithm",Journal of System and Software 84(6), pp 985-992, 2011.
  13. Peng-Yeng Yin, Yung-Pin Cheng and Benjamin B. M. Shao, "Metaheuristic algorithms for Task Assignment in distributed computing system: A comparative and integrative approach", The Open Artificial Intelligence Journal, pp. 16-26(11), 2009.
  14. S. Salcedo-Sanz, X. Yao and Y. Xu, "Hybrid meta-heuristic algorithms for Task Assignment in heterogeneous computer systems", Computers & Operations Research, vol. 33, no. 3, pp. 820-835, 2006.
  15. I. S. Hillier and G. J. Lieberman, "Introduction to Operations Research (4th Ed)", CBS publications and distributors, 1985.
  16. H. A. Taha, "Operations Research: An Introduction", Prentice Hall Inc, New Jersey, 1997.
Index Terms

Computer Science
Information Sciences

Keywords

Task Assignment Problem Task Scheduling Load Balancing

Powered by PhDFocusTM