Efficient GPU Computation Using Task Graph Parallelism-Reference-Cited by-同舟云学术

Efficient GPU Computation Using Task Graph Parallelism

Author:

Lin Dian-Lun,Huang Tsung-Wei

Publisher

Springer International Publishing

Link

Reference30 articles.

1. NVIDIA CUDA graph example. https://github.com/NVIDIA/cuda-samples/blob/master/Samples/simpleCudaGraphs/simpleCudaGraphs.cu

2. OpenMP. https://www.openmp.org

3. Taskflow. https://taskflow.github.io

4. Cuda graph in tensorflow. In: NVIDIA GPU Technology Conference (GTC) (2021). https://www.nvidia.com/en-us/on-demand/session/gtcspring21-s31312/

5. Effortless CUDA graphs. In: NVIDIA GPU Technology Conference (GTC) (2021). https://www.nvidia.com/en-us/on-demand/session/gtcspring21-s32082/

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. GSAP: A GPU-Accelerated Stochastic Graph Partitioner;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

3. Parallel and Heterogeneous Timing Analysis: Partition, Algorithm, and System;Proceedings of the 2024 International Symposium on Physical Design;2024-03-12

5. Non-Blocking GPU-CPU Notifications to Enable More GPU-CPU Parallelism;Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region;2024-01-18