Game-based scheduling algorithm to achieve optimize profit in MapReduce environment

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

MapReduce is a programming model and an associated implementation for processing and generating large data sets. Providing MapReduce as a service is the development future trend. By leveraging the game theory, this paper proposes a scheduling algorithm to deal with the competition for resources between multiple jobs in MapReduce. Firstly, we present a model that could estimate job executing time, and then a utility function of job and an optimization objective are brought forward; thirdly, we present a game model to solve the optimization problem. The proof and the solution are also present. Finally, we implement the algorithm and experiment it in a hadoop cluster. The result shows the present algorithm could schedule jobs rational. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Wan, C., Wang, C., Yuan, Y., & Wang, H. (2013). Game-based scheduling algorithm to achieve optimize profit in MapReduce environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7995 LNCS, pp. 234–240). https://doi.org/10.1007/978-3-642-39479-9_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free