MRBench: A Benchmark for MapReduce Framework
Authors:
- Kiyoung KimKKKiyoung Kim
- Kyungho JeonKJKyungho Jeon
- Hyuck HanHHHyuck Han
- Shin-Gyu KimSKShin-Gyu Kim
- Hyungsoo JungHJHyungsoo Jung
- Heon Y. YeomHYHeon Y. Yeom
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15219097,p. 11-18
Abstract
MapReduce is Google's programming model for easy development of scalable parallel applications which process huge quantity of data on many clusters. Due to its conveniency and efficiency, MapReduce is used in various applications (e.g., Web search services and online analytical processing). However, there are only few good benchmarks to evaluate MapReduce implementations by realistic testsets. In this paper, we present MRBench that is a benchmark for evaluating MapReduce systems. MRBench focuses on processing business oriented queries and concurrent data modifications. To this end, we build MRBench to deal with large volumes of relational data and execute highly complex queries. By MRBench, users can evaluate the performance of MapReduce systems while varying environmental parameters such as data size and the number of (map/reduce) tasks. Our extensive experimental results show that MRBench is a useful tool to benchmark the capability of answering critical business questions.Keywords
This publication has 8 references indexed in Scilit:
- Pig latin2008
- MapReduceCommunications of the ACM, 2008
- Map-reduce-merge2007
- STMBench7ACM SIGOPS Operating Systems Review, 2007
- Scale-up x Scale-out: A Case Study using Nutch/Lucene2007
- Evaluating MapReduce for Multi-core and Multiprocessor Systems2007
- The case for application-specific benchmarking2003
- The 007 Benchmark1993