This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Performance of Byzantine Fault-Tolerant MapReduce
PrePrint
ISSN: 1545-5971
Pedro Costa, Universidade de Lisboa, Lisboa
Marcelo Pasin, University of Neuchatel, Neuchatel
Alysson Bessani, University of Lisboa, Lisboa
Miguel Correia, Technical University of Lisbon, Lisboa
MapReduce is often used for critical data processing, e.g., in the context of scientific or financial simulation. However, there is evidence in the literature that there are arbitrary (or Byzantine) faults that may corrupt the results of MapReduce without being detected. We present a Byzantine fault-tolerant MapReduce framework that can run in two modes: non-speculative and speculative. We thoroughly evaluate experimentally the performance of these two versions of the framework, showing that they use around twice more resources than Hadoop MapReduce, instead of the three times more of alternative solutions. We believe this cost is acceptable for many critical applications.
Index Terms:
Distributed Systems,Software/Software Engineering,Programming Techniques,Distributed programming,Computer Systems Organization,Communication/Networking and Information Technology
Citation:
Pedro Costa, Marcelo Pasin, Alysson Bessani, Miguel Correia, "On the Performance of Byzantine Fault-Tolerant MapReduce," IEEE Transactions on Dependable and Secure Computing, 15 Jan. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TDSC.2013.7>
Usage of this product signifies your acceptance of the Terms of Use.