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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Performance Comparison of Three Batch-Mode Scheduling Heuristics

by Vishu Narula, Jyoti Bansal, Shaveta Garg, Paramjit Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 8
Year of Publication: 2015
Authors: Vishu Narula, Jyoti Bansal, Shaveta Garg, Paramjit Singh
10.5120/ijca2015906135

Vishu Narula, Jyoti Bansal, Shaveta Garg, Paramjit Singh . Performance Comparison of Three Batch-Mode Scheduling Heuristics. International Journal of Computer Applications. 126, 8 ( September 2015), 26-29. DOI=10.5120/ijca2015906135

@article{ 10.5120/ijca2015906135,
author = { Vishu Narula, Jyoti Bansal, Shaveta Garg, Paramjit Singh },
title = { Performance Comparison of Three Batch-Mode Scheduling Heuristics },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 8 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 26-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number8/22573-2015906135/ },
doi = { 10.5120/ijca2015906135 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:46.230641+05:30
%A Vishu Narula
%A Jyoti Bansal
%A Shaveta Garg
%A Paramjit Singh
%T Performance Comparison of Three Batch-Mode Scheduling Heuristics
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 8
%P 26-29
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Grid scheduling issue has been an exploration hotspot lately. Some custom heuristics have been utilized to upgrade it and have got some great results. In any case, selecting the best heuristic to use in a given domain remains a troublesome issue. So to beat this, a few examinations have been made in this paper which will give the data that which heuristic will gives better Makespan, Flowtime and Average completion time value. So in this paper, three heuristics i.e., Min-Min, Max-Min & LJFR-SJFR are chosen, compared, analyzed and executed by using Gridsim 5.2.

References
  1. Mark Baker1, Rajkumar Buyya, et al. 2002, Grids and Grid technologies for wide‐area distributed computing, Software: Practice and Experience, 32(15), pp. 1437-1466.
  2. Patricio Domingues, Artur Andrzejak, et al. 2006, Scheduling for fast turnaround time on institutional desktop grid, CoreGRID TechRep, 0027.
  3. SungJin Choi, HongSoo Kim, et al. 2007, Characterizing and classifying desktop grid, In null, pp. 743-748, IEEE.
  4. Issam Al-Azzoni, Douglas G. Down, et al. 2010, Dynamic scheduling for heterogeneous desktop grids, Journal of Parallel and Distributed Computing, 70(12), pp.1231-1240, ELESEVIER.
  5. Fatos Xhafa. 2007, Immediate mode scheduling of independent’, jobs in computational grids, In Advanced Information Networking and Applications, AINA'07. 21st International Conference, pp. 970-977, IEEE.
  6. K.Hemant K. Reddy, Manas Ranjan Patra, et al. 2012, An adaptive scheduling mechanism for computational desktop grid using gridgain, Procedia Technology, 4, pp.573-578, ELESEVIER.
  7. Francine Berman, Richard Wolski, et al. 2003, Adaptive computing on the grid using AppLeS, Parallel and Distributed Systems, Transactions on, 14(4), pp.369-382, IEEE.
  8. Derrick Kondo, Andrew A. Chien, et al. 2004, Resource management for rapid application turnaround on enterprise desktop grids, In Proceedings of the 2004 ACM/IEEE conference on Supercomputing, pp. 17, IEEE.
  9. HE XiaoShan, SUN XianHe, et al. 2003, QoS guided min-min heuristic for grid task scheduling, Journal of Computer Science and Technology, 18(4), pp.442-451.
  10. Hesam Izakian, Ajith Abraham, et al. 2009, Performance comparison of six efficient pure heuristics for scheduling meta-tasks on heterogeneous distributed environments, Neural Network World, 19(6), pp.695-710.
  11. Braun, Siegel, et al. 2001, 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(6), pp. 810-837.
  12. Hesam Izakian, Ajith Abraham, et al, 2009, Comparison of heuristics for scheduling independent tasks on heterogeneous distributed environments, In Computational Sciences and Optimization, CSO 2009, International Joint Conference, pp. 8-12, IEEE.
  13. Naglaa M. Reda, A. Tawfik, et al. 2014, Sort-Mid tasks scheduling algorithm in grid computing, Journal of Advanced Research.,ELESEVIER.
  14. Muthucumaru Maheswaran, Shoukat Ali, et all. 1999, Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , In Heterogeneous Computing Workshop, HCW 99 Proceedings Eighth, pp.30-44, IEEE.
  15. Lee, Y. H., Leu, S., & Chang, R. S, 2011, Improving job scheduling algorithms in a grid environment , Future generation computer systems, 278, pp.991-998, ELESEVIER.
  16. Chaturvedi, A. K., & Sahu, R, 2011, New heuristic for scheduling of independent tasks in computational grid , International Journal of Grid and Distributed Computing, 43, pp.25-36.
  17. Buyya, Rajkumar, and Manzur Murshed. 2002, Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing Concurrency and computation: practice and experience 14, pp. 1175-1220.
Index Terms

Computer Science
Information Sciences

Keywords

Grid and Desktop Grid computing Min-Min Max-Min & LJFR-SJFR

Powered by PhDFocusTM