科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we study an online scheduling on two parallel machines in MapReduce-like system where each job contains two kinds of tasks: map tasks and reduce tasks. A job's reduce tasks can only be processed after all its map tasks are finished. We assume that the map tasks are fractional and the reduce tasks are preemptive. Our objective is to minimize makespan. We show that the lower bound for this MapReduce scheduling problem is root 2. We then present an online algorithm with competitive ratio of root 2 and thus it is optimal.
- 出版日期2018-6
- 单位浙江理工大学
