A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors

Authors:
Anna S. Nepomniaschaya;Maria A. Dvoskina
Affiliations:
(Correspd.) Laboratory of Parallel Algorithms and Structures, Institute of Computational Mathematics and Mathematical Geophysics, Novosibirsk, Russia. anep@ssd.sscc.ru;(Correspd.) Mathematical Faculty, Novosibirsk State University, Novosibirsk, Russia. maria@land6.nsu.ru
Venue:
Fundamenta Informaticae
Year:
2000

Citing 16
Cited 2

LUCAS associative array processor: design, programming and application studies

LUCAS associative array processor: design, programming and application studies
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Orthogonal computer and its application to some graph problems

Proc. of the Third International Workshop on Parallel processing by cellular automata and arrays
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
The Siberian approach for an open-system high-performance computing architecture

Computing & Control Engineering Journal
Algorithms for Parallel-Search Memories

Journal of the ACM (JACM)
Associative Computing: A Programming Paradigm for Massively Parallel Computers

Associative Computing: A Programming Paradigm for Massively Parallel Computers
Content Addressable Parallel Processors

Content Addressable Parallel Processors
ASC: An Associative-Computing Paradigm

Computer
Associative Processors and Memories: A Survey

IEEE Micro
Vertical Processing Systems: A Survey

IEEE Micro
A Parallelization of Dijkstra's Shortest Path Algorithm

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Solution of Path Problems Using Associative Parallel Processors

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Undirected single source shortest paths in linear time

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae
Associative version of italiano's decremental algorithm for the transitive closure problem

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

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.