Relation-based algorithms and the parallelization of stencil-based computations
Abstract
Relation-based algorithms are simple but general computational patterns: they naturally emerge, among others, in iterative methods for solving linear problems, numerical approximations of partial differential equations and Bayesian networks.
I introduce the notions of relation-based algorithms and discuss the problem of implementing such algorithms in a SPMD (single program multiple data) framework. I outline the two main lines or research that we have been following for deriving understandable specifications and efficient C++ implementations of distributed relation-based algorithms.
Slides
