Solving path problems on the GPU
type: Item
instance of: scholarly article
title: Solving path problems on the GPU
zbMATH Open document ID: 1204.68043
author: Aydin Buluç
author: J. R. Gilbert
author: Ceren Budak
published in: Parallel Computing
publication date: 2010-09-02T00:00:00Z
Mathematics Subject Classification ID: 68M99
zbMATH DE Number: 5777727
zbMATH Keywords: all-pairs shortest-paths
zbMATH Keywords: Gaussian elimination
zbMATH Keywords: graphical processing unit
zbMATH Keywords: semiring
zbMATH Keywords: matrix multiplication
zbMATH Keywords: graph algorithm
zbMATH Keywords: shortest path
zbMATH Keywords: linear algebra
describes a project that uses: BLAS
describes a project that uses: CUDA
describes a project that uses: Boost
describes a project that uses: BGL
MaRDI profile type: Publication
full work available at URL: j.parco.2009.12.002
OpenAlex ID: W2102067213
cites work: Cache-oblivious dynamic programming
cites work: Q5689624
cites work: A set of level 3 basic linear algebra subprograms
cites work: Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
cites work: Locality of Reference in LU Decomposition with Partial Pivoting
cites work: Q4091421
cites work: A Unified Approach to Path Problems
cites work: Gaussian elimination is not optimal
cites work: Matrix multiplication via arithmetic progressions
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs.
cites work: Q4796165
cites work: R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
cites work: Q4506483
cites work: The input/output complexity of transitive closure
DOI: 10.1016/J.PARCO.2009.12.002
description: scientific article; zbMATH DE number 5777727