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

作者：Liang, Wei; Hu, Chunhua^*; Wu, Min; Jin, Qun

来源：Journal of Computer and System Sciences, 2017, 89: 64-79.

DOI：10.1016/j.jcss.2017.01.005

• Data intensive computing
• Scheduling
• Makespan
• NP-hard

Data intensive computing (DIC) provides a high performance computing approach to process large volume of data. In this study, a new formalization is introduced to present the two-stage DIC task execution in a stream manner. A novel heuristic algorithm is proposed for the scheduling problem due to the NP complexity. The theoretical approximation ratio bounds for the heuristic are analyzed and confirmed by the experimental evaluation. Overall, we observe that the proposed method conducts average 1.2 times makespan than the theoretic bound of the optimal solution. Besides, the proposed method outperforms the GA and FIFO scheduling schemes with overall improvements.

• 出版日期2017-11
• 单位中国地质大学（北京）; 湖南商学院