Solution of Path Problems Using Associative Parallel Processors

Authors:
A. S. Nepomniaschaya
Affiliations:
-
Venue:
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Year:
1997

Citing 0
Cited 6

Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors

Programming and Computing Software
An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs

PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph

PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

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

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a question of representing a group of associative algorithms on an abstract model of the SIMD type with vertical data processing (the STAR--machine). This group includes the Warshall transitive closure algorithm, the Floyd shortest path algorithm and the Maggs--Plotkin minimal spanning tree algorithm. These algorithms are represented as the corresponding STAR procedures whose correctness is verified and time complexity is evaluated.