C-MR: continuously executing MapReduce workflows on multi-core processors

  • Authors:
  • Nathan Backman;Karthik Pattabiraman;Rodrigo Fonseca;Ugur Cetintemel

  • Affiliations:
  • Brown University, Providence, RI, USA;Brown University, Providence, RI, USA;Brown University, Providence, RI, USA;Brown University, Providence, RI, USA

  • Venue:
  • Proceedings of third international workshop on MapReduce and its Applications Date
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The widespread appeal of MapReduce is due, in part, to its simple programming model. Programmers provide only application logic while the MapReduce framework handles the logistics of data distribution and parallel task management. We present the Continuous-MapReduce (C-MR) framework which implements a modified MapReduce processing model to continuously execute workflows of MapReduce jobs on unbounded data streams. In keeping with the philosophy of MapReduce, C-MR abstracts away the complexities of parallel stream processing and workflow scheduling while providing the simple and familiar MapReduce programming interface with the addition of stream window semantics. Modifying the MapReduce processing model allowed us to: (1) maintain correct stream order and execution semantics in the presence of parallel and asynchronous processing elements; (2) implement an operator scheduler framework to facilitate latency-oriented scheduling policies for executing complex workflows of MapReduce jobs; and (3) leverage much of the work that has gone into the last decade of stream processing research including: pipelined parallelism, incremental processing for both Map and Reduce operations, minimizing redundant computations, sharing of sub-queries, and adaptive query processing. C-MR was developed for use on a multiprocessor architecture, where we demonstrate its effectiveness at supporting high-performance stream processing even in the presence of load spikes and external workloads.