We show that MapReduce, the de facto standard for large scale data-intensive parallel programming, can be equipped with a programming theory in calculational form. By integrating the generate-and-test programming paradigm and semirings for aggregation of results, we propose a novel parallel programming framework forMapReduce. The framework consists of two important calculation theorems: the shortcut fusion theorem of semiring homomorphisms bridges the gap between specifications and efficient implementations, and the filterembedding theorem helps to develop parallel programs in a systematic and incremental way. © 2012 BCS.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Emoto, K., Fischer, S., & Hu, Z. (2012). Filter-embedding semiring fusion for programming with MapReduce. Formal Aspects of Computing, 24(4–6), 623–645. https://doi.org/10.1007/s00165-012-0241-8