Modular design of data-parallel graph algorithms

Santanu Dash, Sven-Bodo Scholz, B. Christianson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

722 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProcs 2013 Int Conf on High Performance Computing and Simulation
Place of PublicationHelsinki
PublisherIEEE Computer Society
ISBN (Print)978-1-4799-0836-3
Publication statusPublished - 2013
EventProcs 2013 Int Conf on High Performance Computing and Simulation - Helsinki, Finland
Duration: 1 Jul 20135 Jul 2013


ConferenceProcs 2013 Int Conf on High Performance Computing and Simulation


Dive into the research topics of 'Modular design of data-parallel graph algorithms'. Together they form a unique fingerprint.

Cite this