Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/61154
Title: | Joint scheduling of MapReduce jobs with servers : performance bounds and experiments | Authors: | Ling, X Yuan, Y Wang, D Liu, J Yang, J |
Issue Date: | 2016 | Source: | Journal of parallel and distributed computing, 2016, v. 90-91, p. 52-66 | Abstract: | MapReduce-like frameworks have achieved tremendous success for large-scale data processing in data centers. A key feature distinguishing MapReduce from previous parallel models is that it interleaves parallel and sequential computation. Past schemes, and especially their theoretical bounds, on general parallel models are therefore, unlikely to be applied to MapReduce directly. There are many recent studies on MapReduce job and task scheduling. These studies assume that the servers are assigned in advance. In current data centers, multiple MapReduce jobs of different importance levels run together. In this paper, we investigate a schedule problem for MapReduce taking server assignment into consideration as well. We formulate a MapReduce server-job organizer problem (MSJO) and show that it is NP-complete. We develop a 3-approximation algorithm and a fast heuristic design. Moreover, we further propose a novel fine-grained practical algorithm for general MapReduce-like task scheduling problem. Finally, we evaluate our algorithms through both simulations and experiments on Amazon EC2 with an implementation with Hadoop. The results confirm the superiority of our algorithms. | Keywords: | Fast heuristic MapReduce NP-complete Scheduling Server assignment |
Publisher: | Academic Press | Journal: | Journal of parallel and distributed computing | ISSN: | 0743-7315 | DOI: | 10.1016/j.jpdc.2016.02.002 | Rights: | © 2016 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). The following publication Ling, X., Yuan, Y., Wang, D., Liu, J., & Yang, J. (2016). Joint scheduling of mapreduce jobs with servers: Performance bounds and experiments. Journal of Parallel and Distributed Computing, 90, 52-66 is available at https://doi.org/10.1016/j.jpdc.2016.02.002 |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ling_Joint_scheduling_MapReduce.pdf | 1.19 MB | Adobe PDF | View/Open |
Page views
153
Last Week
1
1
Last month
Citations as of Sep 8, 2024
Downloads
176
Citations as of Sep 8, 2024
SCOPUSTM
Citations
18
Last Week
0
0
Last month
Citations as of Sep 19, 2024
WEB OF SCIENCETM
Citations
10
Last Week
0
0
Last month
Citations as of Sep 19, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.