Filter-embedding semiring fusion for programming with MapReduce

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

MapReduce: Simplified data processing on large clusters

11935Citations
N/AReaders
Get full text

Provenance semirings

627Citations
N/AReaders
Get full text

Semiring-based constraint satisfaction and optimization

547Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Functional collection programming with semi-ring dictionaries

14Citations
N/AReaders
Get full text

A verified generate-test-aggregate Coq library for parallel programs extraction

5Citations
N/AReaders
Get full text

A Verified Accumulate Algorithmic Skeleton

5Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 9

75%

Professor / Associate Prof. 2

17%

Lecturer / Post doc 1

8%

Readers' Discipline

Tooltip

Computer Science 12

92%

Energy 1

8%

Save time finding and organizing research with Mendeley

Sign up for free