Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

This article 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 graphs induced by stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients...

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

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 (probabilis...

Parallel Algorithms for Detecting Strongly Connected Components

On-The-Fly Parallel Decomposition of Strongly Connected Components

Several algorithms exist for decomposing strongly connected components (SCCs). To accommodate recent non-reversible trends in hardware, we focus on utilizing multi-core architectures. Specifically, we consider parallelizing SCC algorithms in the setting of an on-the-fly implementation (to be able to detect SCCs while constructing the graph which is particularly useful for several verification t...

Efficient, Reachability-based, Parallel Algorithms for Finding Strongly Connected Components∗ [Technical Report]

Large, complex graphs are increasingly used to represent unstructured data in scientific applications. Applications such as discrete ordinates methods for radiation transport require these graphs to be directed with all cycles eliminated, where cycles are identified by finding the graph.s strongly connected components (SCCs). Deterministic parallel algorithms identify SCCs in polylogarithmic ti...