Relation-based algorithms in a Haskell-based BSP model
We present a Haskell model of a class of parallel computations known as Bulk-Synchronous Parallel. The model is designed to allow the specification of parallel programming tasks, so that solutions can be derived, proven to be correct or at least, since the model is implemented in Haskell, tested in a simple, "clean room" environment. The model is "monadic", in that the main data type involved in parallel computations is an instance of the Monad class. The "do notation" provided by Haskell for monads gives the usage of our BSP model an imperative "look", making it suitable for programmers with less experience in functional programming. After the introduction of the elements of the model, we will present an example of its use in the context of a simple computational pattern, the "relation-based algorithm".
