Benchmarking Dependability of MapReduce Systems

Abstract

MapReduce is a popular programming model for distributed data processing. Extensive research has been conducted on the reliability of MapReduce, ranging from adaptive and on-demand fault-tolerance to new fault-tolerance models. However, realistic benchmarks are still missing to analyze and compare the effectiveness of these proposals. To date, most MapReduce fault-tolerance solutions have been evaluated using micro benchmarks in an ad-hoc and overly simplified setting, which may not be representative of real-world applications. This paper presents MRBS, a comprehensive benchmark suite for evaluating the dependability of MapReduce systems. MRBS includes five benchmarks covering several application domains and a wide range of execution scenarios such as data-intensive vs. compute-intensive applications, or batch applications vs. online interactive applications. MRBS allows to inject various types of faults at different rates. It also considers different application workloads and data loads, and produces extensive reliability, availability and performance statistics. We illustrate the use of MRBS with Hadoop clusters running on Amazon EC2, and on a private cloud.

DOI: 10.1109/SRDS.2012.12

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@article{Sangroya2012BenchmarkingDO, title={Benchmarking Dependability of MapReduce Systems}, author={Amit Sangroya and Dami{\'a}n Serrano and Sara Bouchenak}, journal={2012 IEEE 31st Symposium on Reliable Distributed Systems}, year={2012}, pages={21-30} }