کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4950528 | 1440647 | 2017 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Makespan minimization for MapReduce systems with different servers
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper we study MapReduce scheduling on n parallel machines (servers) with different speeds v1â¥v2â¥â¯â¥vn. Each job contains two kinds of tasks: map tasks and reduce tasks. The job's reduce tasks can only be processed after finishing all its map tasks. We assume that the map tasks are parallelized, i.e., it can be arbitrarily split and parts of the same task can be processed on different machines in parallel, while the reduce tasks are non-parallelizable. We consider both the offline and online scheduling problems. On offline version, if the reduce tasks are non-preemptive, we design an approximation algorithm whose worst case ratio is at most max{1+Î2â1n,Î}, where Î=v1vn is the ratio of the fastest speed to the slowest speed. If the reduce tasks are preemptive, we provide an approximation algorithm with worst case ratio of 2. On online version where jobs arriving over time, we design two heuristics for non-preemptive and preemptive reduce tasks respectively. In experiment, we verify the advantage of our algorithms comparing with the state-of-the-art.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 67, February 2017, Pages 13-21
Journal: Future Generation Computer Systems - Volume 67, February 2017, Pages 13-21
نویسندگان
Yiwei Jiang, Yuqing Zhu, Weili Wu, Deying Li,