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

Wei Liang, Chunhua Hu*, Min Wu, Qun Jin

*この研究の対応する著者

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)64-79
ページ数16
ジャーナルJournal of Computer and System Sciences
89
DOI
出版ステータスPublished - 2017 11

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ ネットワークおよび通信
  • 計算理論と計算数学
  • 応用数学

フィンガープリント

「A data intensive heuristic approach to the two-stage streaming scheduling problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル