All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model
In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm usi...
Saved in:
| Published in: | Journal of networks Vol. 8; no. 12; p. 2797 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Oulu
Academy Publisher
01.12.2013
|
| Subjects: | |
| ISSN: | 1796-2056, 1796-2056 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!