id: 06071515
dt: a
an: 06071515
au: Lesniak, Michael
ti: Palovca: Describing and executing graph algorithms in Haskell.
so: Russo, Claudio (ed.) et al., Practical aspects of declarative languages.
    14th international symposium, PADL 2012, Philadelphia, PA, USA, January
    23‒24, 2012. Proceedings. Berlin: Springer (ISBN
    978-3-642-27693-4/pbk). Lecture Notes in Computer Science 7149, 153-167
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-27694-1_12
ab: Summary: Graph algorithms have fundamental applications in the real world
    but can be both cumbersome to implement in traditional languages and
    difficult to execute efficiently on modern multicore hardware. The Bulk
    Synchronous Parallel model of computation has recently been used to
    define vertex-centric computations on graphs. We describe an embedded
    domain specific language (using Haskell as the underlying host
    language) for specifying such algorithms, and show an implementation of
    an execution platform that allows to execute them on multicore systems
    in parallel. For several benchmarks varying in algorithm, graph size
    and edge distribution, we achieved speedups ranging from 9 up to 11 for
    16 threads.
rv: