| Autor: |
Scott McMillan, John Matty, Andrew Lumsdaine, Samantha Misurda, Eric Holk, Jonathan Chu, Peter Zhang, Marcin Zalewski |
| Rok vydání: |
2015 |
| Předmět: |
|
| Zdroj: |
IA3@SC |
| Popis: |
Dynamic parallelism allows GPU kernels to launch additional kernels at runtime directly from the GPU. In this paper we show that dynamic parallelism enables relatively simple high-performance graph algorithms for GPUs. We present breadth-first search (BFS) and single-source shortest paths (SSSP) algorithms that use dynamic parallelism to adapt to the irregular and data-driven nature of these problems. Our approach results in simple code that closely follows the high-level description of the algorithms but yields performance competitive with the current state of the art. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
