CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 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

Multi Objectives heuristic Algorithm for Grid Computing

by Fahd Alharbi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 46 - Number 18
Year of Publication: 2012
Authors: Fahd Alharbi
10.5120/7045-9691

Fahd Alharbi . Multi Objectives heuristic Algorithm for Grid Computing. International Journal of Computer Applications. 46, 18 ( May 2012), 39-45. DOI=10.5120/7045-9691

@article{ 10.5120/7045-9691,
author = { Fahd Alharbi },
title = { Multi Objectives heuristic Algorithm for Grid Computing },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 46 },
number = { 18 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 39-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume46/number18/7045-9691/ },
doi = { 10.5120/7045-9691 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:40:43.746145+05:30
%A Fahd Alharbi
%T Multi Objectives heuristic Algorithm for Grid Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 46
%N 18
%P 39-45
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Grid computing provides the means of using and sharing heterogeneous resources that are geographically distributed to solve complex scientific or technical problems. Task scheduling is critical to achieving high performance on grid computing environment. The objective of the scheduling process is to map each task with specific requirements to a capable machine in order to minimize the makespan. Task scheduling is shown to be NP-complete problem, which can be solved using heuristic algorithms. Several heuristic algorithms have been proposed in the literature, and they are either not efficient or complex. In this paper, we are proposing a Multi Objectives heuristic Algorithm to minimize the makespan and flow time and to maximize the resource utilization with a low computational complexity.

References
  1. I. Foster, and C. Kesselman, The Grid 2: Blueprint for a New Computing Infrastructure, Second Edition, Elsevier and Morgan Kaufmann Press, 2004.
  2. Zhou Lei and Zhifeng, Allen, Gabrielle Yun, "Grid Resource Allocation," in Grid Computing: Infraestructure, Service, and Applications, Lizhe Wang, Wei Jie, and Jinjun Chen, Eds. Boca Raton: CRC Press, 2009, ch. 7, pp. 1172-188.
  3. Hojjat Baghban, Amir Masoud Rahmani, " A Heuristic on Job Scheduling in Grid Computing Environment", In Proceedings of the seventh IEEE International Conference on Grid and Cooperative Computing, pp. 141-146, 2008. 3605-7, pp. 8-12, 2009.
  4. Li Wenzheng, Zhang Wenyue, " An Improved Scheduling Algorithm for Grid Tasks", International Symposium on Intelligent Ubiquitous Computing and Education, pp. 9-12, 2009.
  5. Hesam Izakian, Ajith Abraham, and Václav Snasel, "Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments," vol. 1, pp. 8-12, 2009.
  6. Fatos Xhafa and Ajith Abraham, Meta-heuristics for Scheduling in Distributed Computing Environments. : Springer-Verlag Berlin Heidelberg, 2008, pp. 1-38, 247-272.
  7. T. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheshwaran, A. Reuther, J. Robertson, M. Theys, B. Yao, D. Hensgen, and R. Freund, "A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems", In 8th IEEE Heterogeneous Computing Workshop(HCW'99), pp. 15-29, 1999.
  8. Tracy D. Braun, Howard Jay Siegel, and Noah Beck, "A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems", Journal of Parallel and Distributed Computing 61, pp. 810-837, 2001.
  9. Miguel L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Fifth Edition. : Springer, 2008.
  10. Izakian Hesam, Abraham Ajith and Snasel Vaclav, Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments, The 2009 IEEE International Workshop on HPC and Grid Applications (IWHGA2009), China, IEEE Press, USA, ISBN 978-0-7695- 3605-7, pp. 8-12, 2009.
  11. J. M. Schopf, "A General Architecture for Scheduling on the Grid", special issue of JPDC on Grid Computing, 2002.
  12. R. F. Freund, and M. Gherrity, "Scheduling Resources in Multi-user Heterogeneous Computing Environment with Smart Net", In Proceedings of the 7th IEEE HCW, 1998.
  13. R. Armstrong, D. Hensgen, and T. Kidd, "The Relative Performance of Various Mapping Algorithms is Independent of Sizable Variances in Run-time Predictions", In 7th IEEE Heterogeneous Computing Workshop(HCW'98), pp. 79-87, 1998.
  14. R. F. Freund and H. J. Siegel,"Heterogeneous Processing", IEEE Computer, 26(6), pp. 13-17, 1993.
  15. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, Dynamic mapping of a class of independent tasks onto heterogeneous computing systems, J. Parallel Distributed Computing 59, 2 (Nov. 1999), 107_121
  16. J. Brevik, D. Nurmi, and R. Wolski, "Automatic Methods for Predicting Machine Availability in Desktop Grid and Peer-to-Peer Systems", In Proceedings of CCGRID'04, pp. 190-199, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Grid Computing Scheduling Makespan Flow Time

Powered by PhDFocusTM