arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.4108cs.DCcs.PF
收藏

Floor-Warshall的多级CUDA核

A Multi-Stage CUDA Kernel for Floyd-Warshall

Ben Lund, Justin W Smith

摘要:

提出了一种新的基于CUDA的Floor-Warshall全对最短路径算法的实现。我们的算法运行速度比以前最好的报告算法快约5倍。为了实现这种加速,我们应用了一种新技术来减少片上共享内存的使用,并允许CUDA调度器更有效地隐藏指令延迟。

英文摘要:

We present a new implementation of the Floyd-Warshall All-Pairs Shortest Paths algorithm on CUDA. Our algorithm runs approximately 5 times faster than the previously best reported algorithm. In order to achieve this speedup, we applied a new technique to reduce usage of on-chip shared memory and allow the CUDA scheduler to more effectively hide instruction latency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑