Towards Optimal Resource Provisioning for Running MapReduce Programs in Public Clouds
Document Type
Conference Proceeding
Publication Date
7-2011
Abstract
Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this paper, we study the whole process of MapReduce processing and build up a cost function that explicitly models the relationship between the amount of input data, the available system resources (Map and Reduce slots), and the complexity of the Reduce function for the target MapReduce job. The model parameters can be learned from test runs with a small number of nodes. Based on this cost model, we can solve a number of decision problems, such as the optimal amount of resources that can minimize the financial cost with a time deadline or minimize the time under certain financial budget. Experimental results show that this cost model performs well on tested MapReduce programs.
Repository Citation
Tian, F.,
& Chen, K.
(2011). Towards Optimal Resource Provisioning for Running MapReduce Programs in Public Clouds. Proceedings of the 2011 IEEE International Conference on Cloud Computing, 155-162.
https://corescholar.libraries.wright.edu/knoesis/902
DOI
10.1109/CLOUD.2011.14
Comments
Presented at the IEEE International Conference on Cloud Computing, Washington, DC, July 4-9, 2011.