Research and development of Johnson's algorithm parallel schemes in GPGPU technology
PROBLEMS IN PROGRAMMING · 2016
DOI: 10.15407/pp2016.02-03.105 ↗At a glance
Journal article in PROBLEMS IN PROGRAMMING, 2016. Written by S.D. Pogorilyy and 1 co-authors. Cited 3 times so far (Crossref); 10 references.
Abstract (original language)
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.
Cite
APA
Pogorilyy, S., & Slynko, M. (2016). Research and development of Johnson's algorithm parallel schemes in GPGPU technology. PROBLEMS IN PROGRAMMING. https://doi.org/10.15407/pp2016.02-03.105
Vancouver
Pogorilyy S, Slynko M. Research and development of Johnson's algorithm parallel schemes in GPGPU technology. PROBLEMS IN PROGRAMMING. 2016. doi:10.15407/pp2016.02-03.105
BibTeX
@article{Pogorilyy2016,
author = {Pogorilyy, S.D. and Slynko, M.S.},
title = {Research and development of Johnson's algorithm parallel schemes in GPGPU technology},
journal = {PROBLEMS IN PROGRAMMING},
year = {2016},
doi = {10.15407/pp2016.02-03.105}
}
EUVIMED