GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components

  • Anton Wijs
  • Joost-Pieter Katoen
  • Dragan Bošnački
Conference paper

DOI: 10.1007/978-3-319-08867-9_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8559)
Cite this paper as:
Wijs A., Katoen JP., Bošnački D. (2014) GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components. In: Biere A., Bloem R. (eds) Computer Aided Verification. CAV 2014. Lecture Notes in Computer Science, vol 8559. Springer, Cham

Abstract

This paper presents parallel algorithms for component decomposition of graph structures on General Purpose Graphics Processing Units (GPUs). In particular, we consider the problem of decomposing sparse graphs into strongly connected components, and decomposing stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients of many (probabilistic) model-checking algorithms. We explain the main rationales behind our GPU-algorithms, and show a significant speed-up over the sequential counterparts in several case studies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Anton Wijs
    • 1
  • Joost-Pieter Katoen
    • 2
  • Dragan Bošnački
    • 1
  1. 1.Eindhoven University of TechnologyThe Netherlands
  2. 2.RWTH Aachen UniversityGermany

Personalised recommendations