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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Wijs, A., Katoen, J. P., & Bošnački, D. (2014). GPU-based graph decomposition into strongly connected and maximal end components. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8559 LNCS, pp. 310–326). Springer Verlag. https://doi.org/10.1007/978-3-319-08867-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
