Makespan minimization for MapReduce systems with different servers
详细信息 查看全文
- 作者：Yiwei Jianga ; ywjiang@zstu.edu.cn" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Yuqing ZhubAuthor Vitae ; Weili WucAuthor Vitae ; Deying LidAuthor Vitae
- 关键词：MapReduce ; Scheduling algorithm ; Worst-case ratio ; Big data
- 刊名：Future Generation Computer Systems
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：67
- 期：Complete
- 页码：13-21
- 全文大小：1114 K
文摘
- class="listitem" id="list_l000005">
- class="label">•
We study the makespan minimization of MapReduce scheduling on servers with different speeds.
- class="label">•
Both online and offline versions of this problem are considered.
- class="label">•
On offline version, we present non-preemptive and preemptive approximation algorithms.
- class="label">•
On online version, we design non-preemptive and preemptive heuristics.
- class="label">•
We verify the advantage of our offline and online algorithms comparing with the state-of-the-art.