Blocked United Algorithm for the All-Pairs Shortest Paths Problem on Hybrid CPU-GPU Systems-Reference-Cited by-同舟云学术

Blocked United Algorithm for the All-Pairs Shortest Paths Problem on Hybrid CPU-GPU Systems

Published:2012 Issue:12 Volume:E95.D Page:2759-2768
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

MATSUMOTO Kazuya¹,NAKASATO Naohito¹,SEDUKHIN Stanislav G.¹

Affiliation:

1. Distributed Parallel Processing Laboratory, the University of Aizu

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E95.D/12/E95.D_2759/_pdf

Reference29 articles.

1. [1] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed., The MIT Press, Massachusetts, USA, 2009.

2. [2] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, NY, USA, 1998.

3. [3] G. Rote, “Path problems in graphs,” Computing Supplementum, vol.7, pp.155-198, 1990.

4. [4] K. Matsumoto and S.G. Sedukhin, “The algebraic path problem on the Cell/B.E. processor,” Tech. Rep. 2010-002, The University of Aizu, 2010. ftp: //ftp.u-aizu.ac.jp/pub/u-aizu/doc/Tech-Report/2010/2010-002.pdf

5. [5] R.W. Floyd, “Algorithm 97: Shortest path,” Commun. ACM, vol.5, no.6, p.345, 1962.

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

1. Efficient Parallel Processing of All-Pairs Shortest Paths on Multicore and GPU Systems;IEEE Transactions on Consumer Electronics;2023

2. Parallel Privacy-Preserving Shortest Path Algorithms;Cryptography;2021-10-14

3. Efficient parallel implementations to compute the diameter of a graph;Concurrency and Computation: Practice and Experience;2020-08-16

4. Efficient GPU Implementations to Compute the Diameter of a Graph;2019 Seventh International Symposium on Computing and Networking (CANDAR);2019-11

5. Developing the Parallelization Methods for Finding the All-Pairs Shortest Paths in Distributed Memory Architecture;2019 IEEE 38th International Performance Computing and Communications Conference (IPCCC);2019-10