Through the analysis of multiple DAGs workflow scheduling on the cloud
we propose multiple DAGs workflow scheduling based on critical path partitioning cluster algorithm. it takes into account the deadline of DAG workflow
designed a new comprehensive evaluation index
Partitioning Cluster Based on the Critical Path
ensuring DAGs completed before the deadline
improving the fairness between multiple DAGs
shortening the delay of execution time
reducing execution time span. Experiments show that this algorithm can improved in the aspect of fairness
time delay and the execution time span.
关键词
Keywords
references
Epema D H J, Naghibzadeh M, Deadline-constrained workflow schedulin algorithmsforinfrastructure as a service clouds[J]. Future Generation Computer Systems, 2013, 29(2): 118-129. DOI: 118
Hirales Carbajal A, Tchernykh A, Yahyapour R, et al. Multiple workflow scheduling strategies with user run time estimates on a grid[J]. Journal of Grid Computing, 2012, 10 (2) : 325-346.
Klavdiya Bochenina, Nikolay Butakov, Alexander Boukhanovsky. Static scheduling of multiple workflows with soft deadlines in non-dedicatedheterogeneous environments[J]. Future Generation Computer Systems, 2016 (55): 51-61. DOI: 51
Bittencourt L F, Madeira E R M. Towards the scheduling of multiple workflows on computational grids[J]. Journal of Grid Computing, 2010, 8(3): 419-441. DOI: 419
Boregowda U, Chakravarthy V. Multiple DAG applications scheduling on a cluster of processors[C]//Comput. Sci, inf. Technol, CSIT 2014. China, Nanjing, 2014: 63-73.
Bochenina K. A comparative study of scheduling algorithms for the multiple deadline-constrained workflows in heterogeneous computing systems with time windows[J]. Procedia Comput. Sci. 2014 (29): 509-522. DOI: 522