In this paper, we consider the recent iterative extensions of the Map-Reduce framework and we argue that they would greatly benefit from the research work that was conducted in the area of dataflow computing more than thirty years ago. In particular, we suggest that the tagged-dataflow model of computation can be used as the formal framework be- hind existing and future iterative generalizations of MapReduce. Moreover, we present various applications in which the tagged model gives elegant solutions with increased parallelism. The tagged-dataflow approach for iterative Map-Reduce creates a number of interesting research challenges which deserve further investigation, such as the requirement for a more sophisticated fault tolerance model.
Bibtex: Charalambidis et al. (2014)
Angelos Charalambidis, Nikolaos Papaspyrou, and Panos Rondogiannis. Tagged dataflow: a formal model for iterative map-reduce. In EDBT/ICDT Workshops, 29–36. 2014. ↩