Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains. This paper analyzes the parallel blocked all-pairs shortest path algorithm at the aim of evaluating the influence of the multi-core system and its...
Saved in:
Main Authors: | O. N. Karasik, A. A. Prihozhy |
---|---|
Format: | Article |
Language: | English |
Published: |
Belarusian National Technical University
2022-12-01
|
Series: | Системный анализ и прикладная информатика |
Subjects: | |
Online Access: | https://sapi.bntu.by/jour/article/view/582 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
by: A. A. Prihozhy
Published: (2021-10-01) -
Influence of shortest path algorithms on energy consumption of multi-core processors
by: A. A. Prihozhy, et al.
Published: (2023-10-01) -
New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes
by: A. A. Prihozhy, et al.
Published: (2024-01-01) -
Multi-point path planning based on the algorithm of colony-particle swarm optimization
by: Lijue LIU, et al.
Published: (2019-02-01) -
Improved artificial fish-swarm algorithm based on adaptive vision for solving the shortest path problem
by: Xian-min MA, et al.
Published: (2014-01-01)