Contribution in edited book
Palovca: Describing and Executing Graph Algorithms in Haskell



Publication Details
Authors:
Lesniak, M.
Editor:
Russo C, Zhou N
Publisher:
Springer Berlin Heidelberg
Place:
Philadelphia
Publication year:
2012
Pages range:
153-167
Book title:
Practical Aspects of Declarative Languages
Title of series:
Lecture Notes in Computer Science
Volume number:
7149
ISBN:
978-3-642-27693-4

Abstract
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 em- bedded 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.


Research Areas


Last updated on 2019-25-07 at 14:23