10- https://doi.org/10.1109/aispas.1997.581703
Efficient parallel and distributed topological sort algorithms
- Mar 17, 1997
- J Ma +3 more
Abstract
In this paper, we give efficient parallel and distributed algorithms for the topological sort problem on acyclic graphs with n vertices. Our parallel algorithm solves the problem on a CREW PRAM in O(log/sup 2/ n) time with O(M(n)/log n) processors, where M(n) denotes the number of processors needed to multiply two n/spl times/n integer matrices over the integer ring. The best known upper bound of M(n) is O(n/sup 2.376/). The parallel algorithm can also solve the problem on processor arrays with reconfigurable bus systems in O(1) time and O(n/sup 3/) processors. Our distributed algorithm solves the topological sort problem of an arbitrary asynchronous network with communication complexity O(n/sup 2/).
- # Reconfigurable Bus Systems
- # CREW PRAM
- # Topological Problem
- # Processor Arrays
- # Integer Ring
- # Integer Matrices
- # Acyclic Graphs
- # Communication Complexity
- # Efficient Parallel
- # Topological Sort
