7924

Optimizing MapReduce for GPUs with effective shared memory usage

Linchuan Chen, Gagan Agrawal
Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43210
21st international symposium on High-Performance Parallel and Distributed Computing (HPDC ’12), 2012

@inproceedings{chen2012optimizing,

   title={Optimizing MapReduce for GPUs with effective shared memory usage},

   author={Chen, L. and Agrawal, G.},

   booktitle={Proceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing},

   pages={199–210},

   year={2012},

   organization={ACM}

}

Download Download (PDF)   View View   Source Source   

1420

views

Accelerators and heterogeneous architectures in general, and GPUs in particular, have recently emerged as major players in high performance computing. For many classes of applications, MapReduce has emerged as the framework for easing parallel programming and improving programmer productivity. There have already been several efforts on implementing MapReduce on GPUs. In this paper, we propose a new implementation of MapReduce for GPUs, which is very effective in utilizing shared memory, a small programmable cache on modern GPUs. The main idea is to use a reduction-based method to execute a MapReduce application. The reduction-based method allows us to carry out reductions in shared memory. To support a general and efficient implementation, we support the following features: a memory hierarchy for maintaining the reduction object, a multi-group scheme in shared memory to trade-off space requirements and locking overheads, a general and efficient data structure for the reduction object, and an efficient swapping mechanism. We have evaluated our framework with seven commonly used MapReduce applications and compared it with the sequential implementations, MapCG, a recent MapReduce implementation on GPUs, and Ji et al.’s work, a recent MapReduce implementation that utilizes shared memory in a different way. The main observations from our experimental results are as follows. For four of the seven applications that can be considered as reduction-intensive applications, our framework has a speedup of between 5 and 200 over MapCG (for large datasets). Similarly, we achieved a speedup of between 2 and 60 over Ji et al.’s work.
Rating: 2.5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: