Open Access Open Access  Restricted Access Subscription or Fee Access

Heuristics Based Survey on Workflow Scheduling in Computational Grids

E. Saravana Kumar, A. Sumathi

Abstract


Grid computing has emerged as the next-generation parallel and distributed computing that aggregates heterogeneous resources for solving and obtain a feasible solution of computational intensive problems. In grid environments, applications are always regarded as workflows. One of the most challenging problems in grid computing is to schedule the workflow to achieve high performance. This paper aims to compare the various workflow scheduling algorithms in a computational grid.

Keywords


Grid Computing, Workflow Scheduling

Full Text:

PDF

References


Ruay-shiung Chang, Jih-Sheng Chang, Po- Sheng Lin, “An ant algorithm for balanced job scheduling in grids”, Future Gen. Comput.Syst.,vol.25.pp.20-27, 2009

Ian Foster, Carl Kesselman, Morgan Kaufman, “The Grid: Blueprint for a Future Computing Infrastructure. 1998.

J.Yu, R.Buyya, “ A taxonomy of workflow management systems for workflow scheduling, Tech. Rep, University of Melbourne, Australia, March 2005.

A.Mayer, S.Mc Gough, N.Furmento, W.Lee, M.Gulamali, S.Newhosue, J.Darlington, Workflow Expression: Comparision of Spatial and temporal approaches in workflow in Grid Systems Workshop, GGF-10, Berlin, March 9, 2004.

I.Altintas, and A. Birnbaum, K.Baldridge, W.Sudholt, M.Millar, C.Amoreira, Y.Potier, B.Ludoeschar, “ A Framework for the design and reuse of grid workflows”, International workshop on Scientific Applications on Grid Computing. SAG‟05 LNCS, Vol, 3458, Springer 2005.

M.R Garey, D.S Johnson, “Computers and Intractability: A Guide to the theory of NP-Completeness”, W.H Freeman and Co., New York, 1997.

E.Deelman, J.Blythe, Y.Gil,”Pegasus: Mapping Scientific Workflow onto the Grid”, Across Grifs Conference 2004, Nicosia, Cyprus 2004.

C.Kesselman, E.Deelman, J.Blythe, Y.Gil, “Workflow Management in Grid Phyn,” The Grid Resource Management, Kulwer, Netherlands, 2003.

B.Ludascher, I.Altintas, A.Gupta, “Compiling abstract scienticfic workflows in 15th Int.Conf on Scientific and statistical database management”, 9-11 July, Cambridge, Massachusatts, USA, IEEE CS Press, Los Alamitos, CA, USA 2003, p.p 241-244.

Jia Yu, Rajkumar Buyya, “ A taxonomy of workflow management systems for grid computing”, Journal of Grid Computing 3 (3-4) 2005, p.p 171-200.

Dimosthensis Kyriazis, Konstantinos Tserpes, Andreas Menychats, Antonis Litke, Theodora Varvarigou, “ An Innovative workflow mapping mechanism for Grids in the frame of Quality of Service”, Future Gen.Comput.Syst., vol.24.pp.498-511,2008.

Anirban Mandal, Ken Kennedy, Charles Koelbel, “Scheduling Strategies for Mapping Application Workflows onto the Grid”, IEEE pp.125-134, 2005.

Mc Cready.S (1992) “There is more than one kind of workflow software”, Computer World, November 2,pp.86-90.

Kochut.K, A.P Sheth et al.., “Optimizing Workflow” Component Strategies, vol.9, pp.45-57, 1999.

Eder.J and W. Kiebhat, “Workflow Discovery”, IFCIS conf. on cooperative information systems, Brussels, Belgium. pp 124-134, 1996.

K.Krishnakumar and A.P Sheth, “Managing Heterogeneous Multi System tasks to support enterprise wide operations”, Distributed and parallel databases journal, Vol 2, pp. 155-186, 1995.

R.Armstrong, D.Hensgen and T.Kidd, “ The relative performance of various mapping algorithms in independent of sizable variances in run time predictions”, 7th IEEE Heterogeneous computing workshop (HCW‟98) pp.79-87, 1998.

O.H Ibarra and C.E Kim,” Heuristic algorithms for searching independent tasks on non identical processes”, Journal of Association Computing Machine. Vol.24, p.p 280-289, 1997

R.F Freund, M.Gherrity, S.Ambrousis, M. Chambell et al, “Scheduling Resources in multi-user, heterogeneous, computing environments with samartnet”, 7th IEEE Heterogeneous Computing Workshop, p.p 184-299, 1998.

Z.Michaelwiz and D.B Fogel, “How to solve it: Modern Heuristics”, Springer-Verlag, New yark, 2000.

I.De Falco, R.Del Balio, E.Tarantino and R.Vaccaro,” Improving search incorporating evolution principles in parallel tabu search”, IEEE Conf. on Evolutionary Computation, vol 2, p.p 823-828, 1994.

J.Yu, R.Buyya, C.K Them, “ A Cost- based scheduling of scientific workflow applications on utility Grids”, First IEEE Int.Conf on e-science and Grid computing, Melbourne, Australia, p.p 5-8, 2005.

H.Casanova et al., “Heuristics for scheduling parameter sweep applications in Grid Environments”, 9th Heterogeneous Computiong Workshop (HCW‟00), Apr 2000.

Marco Dorigo, Mauro Birattari, and Thomasd Stiitzle, “ Ant Colony Optimization”, IEEE omputational Intelligence magazine, p.p 28-39, November 2006.

V.D. Martino and M.Miliotti, “Scheduling in a grid computing environment using genetic algorithms”, in Proc.int.Parallel Distrib.Process.sym. (IPDPS‟02), IEEE, pp.235-239.

D.Abramson, R.buyya, and j.giddy, “A Computational economy for grid computing and its implementation in the Nimrod-G resource broker”, Future Gen.Comput.Syst., Vol. 18, pp. 1061-1074, 2002.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.