@InProceedings{monad-par-2011,
   author = {Simon Marlow and Ryan Newton and Simon {Peyton Jones}},
   title = {A Monad for Deterministic Parallelism},
   booktitle = {Haskell '11: Proceedings of the Fourth ACM SIGPLAN Symposium on Haskell},
   year = {2011},
   abstract = {We present a new programming model for deterministic parallel
computation in a pure functional language.  The model is monadic and
has explicit granularity, but allows dynamic construction of dataflow
networks that are scheduled at runtime, while remaining deterministic
and pure.  The implementation is based on monadic concurrency, which
has until now only been used to simulate concurrency in functional
languages, rather than to provide parallelism.  We present the API
with its semantics, and argue that parallel execution is
deterministic.  Furthermore, we present a complete work-stealing
scheduler implemented as a Haskell library, and we show that it
performs at least as well as the existing parallel programming models
in Haskell.
},
   url = {http://community.haskell.org/~simonmar/papers/monad-par.pdf},
   location = {Tokyo, Japan},
   publisher = {ACM}
}