| Autor: |
Shabeera, T.P., Madhu Kumar, S.D. |
| Zdroj: |
International Journal of Big Data Intelligence; January 2015, Vol. 2 Issue: 1 p2-8, 7p |
| Abstrakt: |
Big data is getting more attention in today’s world. Although MapReduce is successful in processing big data, it has some performance bottlenecks when deployed in cloud. Data locality has an important role among them. The focus of this paper is on improving data locality in MapReduce cloud by allocating adjacent VMs, for executing MapReduce jobs. Good data locality reduces cross network traffic and hence results in high performance. When a user requests for a set of virtual machines (VMs), VMs are chosen based on their physical distance between other VMs. We propose a greedy algorithm for creating cluster of VMs. Greedy methods do not give an optimal solution. The second method for the allocation of VMs is via partitioning around medoids method. Partitioning around medoids method always find a local minimum. This allocation may not be globally optimised. We also present a dynamic programming approach which is guaranteed to find an optimal solution from the users’ perspective. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
