计算机应用研究2014，Vol.31Issue(5)：1407-1409,1413,4.DOI:10.3969/j.issn.1001-3695.2014.05.029
两种GPU上改进的最短路径算法
Two improved shortest path algorithms on GPU
LIU Xin 1WANG Fei1
作者信息
- 1. Shenzhen Graduate School，Harbin Institude of Technology，Shenzhen Guangdong 518055，Chin
- 折叠
摘要
Abstract
In order to solve the shortest path problem， this paper presented two improved shortest path search algorithms on GPU： the iterative Advanced_Atomics_SSSP algorithm based on atomic lock for single source shortest path problem and Heap_APSP algorithm base关键词
Dijkstra算法/单源最短路径/所有顶点间最短路径/GPU/原子锁/二叉堆Key words
Dijkstra algorithm/single source shortest path/all pair shortest paths/GPU/atomic lock/binary heap分类
信息技术与安全科学引用本文复制引用
LIU Xin,WANG Fei..两种GPU上改进的最短路径算法[J].计算机应用研究,2014,31(5):1407-1409,1413,4.
