Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jcss.2017.01.005 | Journal of Computer and System Sciences |
Keywords | Field | DocType |
Data intensive computing,Scheduling,Makespan,NP-hard | Discrete mathematics,Mathematical optimization,Heuristic,Job shop scheduling,Data-intensive computing,Fair-share scheduling,Scheduling (computing),Heuristic (computer science),Computer science,Parallel computing,Dynamic priority scheduling,NP | Journal |
Volume | ISSN | Citations |
89 | 0022-0000 | 0 |
PageRank | References | Authors |
0.34 | 24 | 4 |