The STAPL Parallel Graph Library

Harshvardhan, Adam Fidel, Nancy M. Amato, Lawrence Rauchwerger

Research output: Chapter in Book/Report/Conference proceedingChapter

16 Scopus citations

Abstract

This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
Original languageEnglish (US)
Title of host publicationLanguages and Compilers for Parallel Computing
PublisherSpringer Nature
Pages46-60
Number of pages15
ISBN (Print)9783642376573
DOIs
StatePublished - 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'The STAPL Parallel Graph Library'. Together they form a unique fingerprint.

Cite this