A look-ahead algorithm for online multiple workflow scheduling problem in heterogeneous systems

A look-ahead algorithm is proposed to solve the online multiple workflow scheduling problem with two constraints in heterogeneous system. In this problem, workflows come to the system online when they are released, and each workflow is composed of multiple tasks which can be executed on heterogeneous processors, according to their types. Considered two constrains including the non-preemptive processor and the task order in a workflow, the proposed algorithm utilizes the information contained in the list of the submitted workflows and optimizes the scheduling of current task according to subsequent tasks. It can keep the subsequent tasks from waiting for a long time due to the occupation of the limited resource by the current task. The simulation results show that the proposed look-ahead algorithm outperforms four classical online scheduling algorithms, and the algorithm can get better performance when the look-ahead value L = 1 than L ≥ 2.

[1]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[2]  Moslem Yousefi,et al.  An evolutionary approach for solving the job shop scheduling problem in a service industry , 2015 .

[3]  Xiao Xia,et al.  Hybrid Scheduling Strategy for Multiple DAGs Workflow in Heterogeneous System , 2012 .

[4]  Rizos Sakellariou,et al.  A hybrid heuristic for DAG scheduling on heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[5]  Fang Dong,et al.  Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform , 2013, J. Syst. Softw..

[6]  Xin Chen,et al.  Scheduling on parallel identical machines with late work criterion: Offline and online cases , 2016, J. Sched..

[7]  Steven J. Beaty.  Lookahead scheduling , 1992, MICRO.

[8]  Qingbo Wu,et al.  Workflow scheduling in cloud: a survey , 2015, The Journal of Supercomputing.

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

[10]  Biren Prasad,et al.  A concurrent function deployment technique for a workgroup-based engineering design process , 2000 .

[11]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[12]  Xia Xiao,et al.  Hybrid Scheduling Strategy for Multiple DAGs Workflow in Heterogeneous System: Hybrid Scheduling Strategy for Multiple DAGs Workflow in Heterogeneous System , 2012 .

[13]  Weisong Shi,et al.  A Planner-Guided Scheduling Strategy for Multiple Workflow Applications , 2008, 2008 International Conference on Parallel Processing - Workshops.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Sandeep K. S. Gupta,et al.  Energy-Efficient Thermal-Aware Task Scheduling for Homogeneous High-Performance Computing Data Centers: A Cyber-Physical Approach , 2008, IEEE Transactions on Parallel and Distributed Systems.

[16]  Biren Prasad.  On mapping tasks during product development , 2016, Concurr. Eng. Res. Appl..

[17]  Emmanuel Jeannot,et al.  Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics , 2008, CoreGRID Integration Workshop.

[18]  Rizos Sakellariou,et al.  Scheduling multiple DAGs onto heterogeneous systems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[19]  Milad Yousefi,et al.  Minimizing Earliness and Tardiness Penalties in a Single Machine Scheduling Against Common Due Date using Genetic Algorithm , 2012 .

[20]  Jianxun Liu,et al.  A Constraint-driven Execution Plan for Maximizing Concurrency in Product Development , 2003, Concurr. Eng. Res. Appl..

[21]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[22]  Kuo-Chan Huang,et al.  Online scheduling of workflow applications in grid environments , 2011, Future Gener. Comput. Syst..

[23]  Jiong Yu,et al.  Multiple DAGs Scheduling Based on Lowest Transportation and Completion Time Algorithm on the Cloud , 2012, 2012 Seventh ChinaGrid Annual Conference.

[24]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[25]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[26]  Rizos Sakellariou,et al.  DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.

[27]  Renfa Li,et al.  A priority constrained scheduling strategy of multiple workflows for cloud computing , 2012, 2012 14th International Conference on Advanced Communication Technology (ICACT).

[28]  Weisong Shi,et al.  Queue Waiting Time Aware Dynamic Workflow Scheduling in Multicluster Environments , 2010, Journal of Computer Science and Technology.

[29]  Yang Xu,et al.  Multiple DAGs Dynamic Workflow Scheduling Based on the Primary Backup Algorithm in Cloud Computing System , 2014, 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications.

[30]  Rajkumar Buyya,et al.  Scheduling of Scientific Workflows on Data Grids , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[31]  Arjan J. C. van Gemund,et al.  Fast and effective task scheduling in heterogeneous systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).