2025-02-22T10:08:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-185%22&qt=morelikethis&rows=5
2025-02-22T10:08:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-185%22&qt=morelikethis&rows=5
2025-02-22T10:08:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T10:08:19-05:00 DEBUG: Deserialized SOLR response
Research and development of Johnson's algorithm parallel schemes in GPGPU technology

Research and development of Johnson's algorithm parallel schemes in GPGPU technology

Johnson’s all pairs shortest path algorithm application in an edge weighted, directed graph is considered. Its formalization in terms of Glushkov’s modified systems of algorithmic algebras was made. The expediency of using GPGPU technology to accelerate the algorithm is proved. A number of schemas o...

Full description

Saved in:
Bibliographic Details
Main Authors: Pogorilyy, S.D., Slynko, M.S.
Format: Article
Language:Ukrainian
Published: Інститут програмних систем НАН України 2018
Subjects:
NVidia CUDA
GPGPU
SSSP
APSP
Thrust
SAA scheme
Johnson’s algorithm
UDC 004.3
Online Access:https://pp.isofts.kiev.ua/index.php/ojs1/article/view/185
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Johnson’s all pairs shortest path algorithm application in an edge weighted, directed graph is considered. Its formalization in terms of Glushkov’s modified systems of algorithmic algebras was made. The expediency of using GPGPU technology to accelerate the algorithm is proved. A number of schemas of parallel algorithm optimized for using in GPGPU were obtained. Suggested approach to the implementation of the schemes obtained using computing architecture NVIDIA CUDA. An experimental study of improved performance by using GPU for computations was made.Problems in programming 2016; 2-3: 105-112

Similar Items