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...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Pogorilyy, S.D., Slynko, M.S. |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| 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!
|
| Journal Title: | Problems in programming |
| Download file: | |
Institution
Problems in programmingSimilar Items
-
Transition systems as method of designing applications in GPGPU technology
by: Kryvyi, S.L., et al.
Published: (2018) -
Research and development of Johnson's algorithm parallel schemes in GPGPU technology
by: S. D. Pohorilyi, et al.
Published: (2016) -
Approaches to realization Yen’s algorithm for systems with the shared memory
by: Pogorilyy, S.D., et al.
Published: (2025) -
ПРОГРАМНА МОДЕЛЬ БАГАТОПОТОКОВОГО ПРОЦЕСОРА НА БАЗІ ГРАФІЧНИХ ПРИСКОРЕНЬ
by: Зименко, Андрей Евгеньевич, et al.
Published: (2008) -
Research of the application of GPGPU and TPU technologies for ensuring comment quality in version control systems
by: Semonov, B.O., et al.
Published: (2025)