Dynamic parallelism for simple and efficient GPU graph algorithms.
Peter ZhangEric HolkJohn MattySamantha MisurdaMarcin ZalewskiJonathan ChuScott McMillanAndrew LumsdainePublished in: IA3@SC (2015)
Keyphrases
- parallel architectures
- computationally efficient
- graph theory
- dynamic graph
- computationally expensive
- highly efficient
- computationally intensive
- parallel processing
- real time
- partitioning algorithm
- learning algorithm
- weighted graph
- worst case
- parallel computing
- graph representation
- minimum spanning tree
- query processing
- straight forward
- gpu accelerated