Modular design of data-parallel graph algorithms

Dash, Santanu, Scholz, Sven-Bodo and Christianson, B. (2013) Modular design of data-parallel graph algorithms. In: Procs 2013 Int Conf on High Performance Computing and Simulation :. Institute of Electrical and Electronics Engineers (IEEE), FIN, pp. 398-404. ISBN 978-1-4799-0836-3
Copy

Amorphous Data Parallelism has proven to be a suitable vehicle for implementing concurrent graph algorithms effectively on multi-core architectures. In view of the growing complexity of graph algorithms for information analysis, there is a need to facilitate modular design techniques in the context of Amorphous Data Parallelism. In this paper, we investigate what it takes to formulate algorithms possessing Amorphous Data Parallelism in a modular fashion enabling a large degree of code re-use. Using the betweenness centrality algorithm, a widely popular algorithm in the analysis of social networks, we demonstrate that a single optimisation technique can suffice to enable a modular programming style without loosing the efficiency of a tailor-made monolithic implementation.


picture_as_pdf
apmm2013_submission_5.pdf
subject
Submitted Version

View Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads