Volume 8 Number 4 (Apr. 2013)
Home > Archive > 2013 > Volume 8 Number 4 (Apr. 2013) >
JCP 2013 Vol.8(4): 842-850 ISSN: 1796-203X
doi: 10.4304/jcp.8.4.842-850

Deadline Guarantee Enhanced Scheduling of Scientific Workflow Applications in Grid

Chaokun Yan1, Huimin Luo1, Zhigang Hu2, Xi Li2, and Yanping Zhang3
1 School of Computer and Information Engineering, Henan University, Kaifeng, China; School of Information Science and Engineering, Central South University, Changsha, China
2 School of Information Science and Engineering, Central South University, Changsha, China
3 Department of Genome Oriented Bioinformatics, Technical University of Munich, Freising, Germany


Abstract—Many scientific workflow applications often have deadline constraint such that all tasks of application need to be finished within user-specified time. Though Grid systems have high performance, which provide an important infrastructure for executing scientific workflow, dynamic nature of Grid resources makes it very difficult to schedule workflow and satisfy the given deadline. For this issue, a M/M/C queuing model was adopted to model dynamic service capacity of grid resource. Under dynamic, unreliable grid environment, based on queuing system theory, a probability of meeting deadline for each task can be calculated. The detail analytic method and proof was given in the paper. Specifically, a novel probability evaluation based scheduling algorithm is proposed to address the problem of workflow’ deadline guarantee. The results of large scale simulation experiments with real Protein annotation workflow demonstrate that our algorithm can remarkably improve the predictability of workflow completion and guarantee user’s deadline requirements.

Index Terms—Scientific Workflow, Deadline, unreliable, Grid, Markov, queuing model

[PDF]

Cite: Chaokun Yan, Huimin Luo, Zhigang Hu, Xi Li, and Yanping Zhang, " Deadline Guarantee Enhanced Scheduling of Scientific Workflow Applications in Grid," Journal of Computers vol. 8, no. 4, pp. 842-850, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Read more>>