Affiliations: Laboratory of Parallel Algorithms and Structures, Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, Russia. anep@ssd.sscc.ru | Mathematical Faculty, Novosibirsk State University, Novosibirsk, Russia. maria@land6.nsu.ru
Note: [] Address for correspondence: Laboratory of Parallel Algorithms and Structures, Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, Russia
Note: [] Address for correspondence: Mathematical Faculty, Novosibirsk State University, Novosibirsk, Russia
Abstract: In this paper we propose a natural straight forward implementation of Dijkstra's shortest path algorithm on a model of associative parallel processors of the SIMD type with bit-serial (or vertical) processing (the STAR-machine). In addition, we show how to extend this implementation for restoring the shortest path from the source vertex to a given vertex. These algorithms of implementation are represented as the corresponding STAR procedures whose correctness is verified and time complexity is evaluated.
Keywords: Dijkstra's shortest path algorithm, the single-source shortest path problem, a directed weighted graph, associative parallel processing, time complexity
