Association for Computing Machinery
In this paper, the authors present a parallel method to evaluate functions on pairs of elements. It is a challenge to partition the Cartesian product of a set with itself in order to parallelize the function evaluation on all pairs. Their solution uses replication of set elements to allow for partitioning and aggregation of the results gathered for different copies of an element. Based on an execution model with nodes that execute tasks on local data without online communication, they present a generic algorithm and show how it can be implemented with MapReduce.