Google’s MapReduce Programming Model — Revisited

by Ralf Lämmel

Citations:

29 - 1 self

User correction supplied by lmr

Datum	Value	Source
TITLE	Google’s MapReduce Programming Model — Revisited	user correction
AUTHOR NAME	Ralf Lämmel	user correction
AUTHOR AFFIL	; Data Programmability Team	user correction
AUTHOR ADDR	; Redmond, WA, USA	user correction
ABSTRACT	Google’s MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google’s domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on MapReduce and Sawzall, and we capture our findings as an executable specification. We also identify and resolve some obscurities in the informal presentation given in the seminal papers. We use typed functional programming (specifically Haskell) as a tool for design recovery and executable specification. Our development comprises three components: (i) the basic program skeleton that underlies MapReduce computations; (ii) the opportunities for parallelism in executing MapReduce computations; (iii) the fundamental characteristics of Sawzall’s aggregators as an advancement of the MapReduce approach. Our development does not formalize the more implementational aspects of an actual, distributed execution of MapReduce computations.	SVM HeaderParse 0.2
CITATIONS	33 found	ParsCit 1.0