The stapl Parallel Graph Library

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

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

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.

Original languageEnglish (US)
Title of host publicationLanguages and Compilers for Parallel Computing - 25th International Workshop, LCPC 2012, Revised Selected Papers
Pages46-60
Number of pages15
DOIs
StatePublished - 2013
Externally publishedYes
Event25th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2012 - Tokyo, Japan
Duration: Sep 11 2012Sep 13 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7760 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2012
CountryJapan
CityTokyo
Period9/11/129/13/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this