LDAG: a new model for grid workflow applications

Grid workflow and its application are one of main focuses of Grid Computing. Due to data or control dependencies between tasks and the requirement of no directed circuit, Directed Acyclic Graph (DAG) is a natural model for Grid workflow, and has been extensively used in Grid workflow modeling. For some workflow applications, there may exist another requirement that each task should be accomplished at an expected stage, that is, at a given level. In this paper, we discuss such workflow applications in depth, and propose a new DAG model, which we called LDAG. In LDAG, each node possesses a level. Several cases of the level of nodes are discussed in detail. For a reasonable one of these cases, we propose the topological sorting algorithm. The algorithm consists of two phases, namely Level Adjusting and Topological Sorting. We discuss some relevant problems, such as choice of stack or queue, the determination of directed circuit, complexity of the algorithm, etc. The experiment and analysis of LDAG and topological sorting algorithm show its correctness and efficiency in modeling grid workflow.

[1]  Hai Jin,et al.  PGWFT: A Petri Net Based Grid Workflow Verification and Optimization Toolkit , 2008, GPC.

[2]  John Darlington,et al.  Mapping of Scientific Workflow within the e-Protein project to Distributed Resources , 2004 .

[3]  Ciprian Dobre,et al.  Genetic algorithm for DAG scheduling in Grid environments , 2009, 2009 IEEE 5th International Conference on Intelligent Computer Communication and Processing.

[4]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[5]  Jarek Nabrzyski,et al.  Workflow applications in GridLab and PROGRESS projects , 2006, Concurr. Comput. Pract. Exp..

[6]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[7]  Vahid Rafe,et al.  Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems , 2008, ICTAC.

[8]  Xiaoping Li,et al.  Deadline division-based heuristic for cost optimization in workflow scheduling , 2009, Inf. Sci..

[9]  Jingsha He,et al.  Towards critical region reliability support for Grid workflows , 2009, J. Parallel Distributed Comput..

[10]  Sung-Chun Kim,et al.  Task Scheduling Algorithm in GRID Considering Heterogeneous Environment , 2004, PDPTA.

[11]  Sergei Gorlatch,et al.  A Grid Workflow Language Using High-Level Petri Nets , 2005, PPAM.

[12]  Kaizar Amin,et al.  GridAnt: a client-controllable grid workflow system , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[13]  Hai Jin,et al.  DAGMap: efficient and dependable scheduling of DAG workflow job in Grid , 2010, The Journal of Supercomputing.

[14]  Simon See,et al.  Modeling and Verifying Non-DAG Workflows for Computational Grids , 2007, 2007 IEEE Congress on Services (Services 2007).

[15]  Smruti R. Sarangi,et al.  Theoretical Framework for Eliminating Redundancy in Workflows , 2009, 2009 IEEE International Conference on Services Computing.

[16]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[17]  Leila Jemni Ben Ayed,et al.  Extended UML activity diagram for composing Grid services workflows , 2008, 2008 Third International Conference on Risks and Security of Internet and Systems.

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[19]  Arnold L. Rosenberg,et al.  A Tool for Prioritizing DAGMan Jobs and its Evaluation , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[20]  Frédéric Vivien,et al.  Allocating Series of Workflows on Computing Grids , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.