For dynamic data processing on the graphics processor (GPU), the analysis of existing parallel single-source shortest path (SSSP) algorithm based on the Moore SSSP algorithm on GPU Parallel design and realization. Search application level task allocation, hierarchical work queue, hierarchical Kernel call strategy. Experimental tests on the different types of map data, experimental results show that the algorithm can effectively reduce the empty thread overhead and memory access overhead and synchronization time.

基于GPU的单源最短路径算法设计与实现.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．