A data intensive heuristic approach to the two-stage streaming scheduling problem

作者：

Highlights：

• A hybrid scheduling formalization is presented to address the DIC scheduling problem.

• Both the one-stage and two-stage scheduling situations are analyzed in the work.

• A heuristic algorithm is proposed to minimize the Makespan with NP complexity.

• The approximation ratio bound for the algorithm is analyzed theoretically.

摘要

•A hybrid scheduling formalization is presented to address the DIC scheduling problem.•Both the one-stage and two-stage scheduling situations are analyzed in the work.•A heuristic algorithm is proposed to minimize the Makespan with NP complexity.•The approximation ratio bound for the algorithm is analyzed theoretically.

论文关键词：Data intensive computing,Scheduling,Makespan,NP-hard

论文评审过程：Received 27 February 2016, Revised 13 November 2016, Accepted 20 January 2017, Available online 8 February 2017, Version of Record 7 August 2017.

论文官网地址：https://doi.org/10.1016/j.jcss.2017.01.005