Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
Abstarct: In this paper, we give eficient parallel and distributed algomthms for the topological sort problem on acyclic graphs with n vertices. Our parallel algorithm solves the problem on a CREW PRAM in O(log2 n) time with O(M(n)/ log n) processors, where M(n) denotes the number of processors needed to multiply two n x n integer matrices over the integer ring. The best known upper bound of M(n) is O(n2.376). The parallel algorithm can also solve the problem on processor arrays with recon$gurable bus systems in O(1) time and O(n3) processors. Our distributed algorithm solves the topological sort problem of an arbitrary asynchronous network with communication complexity O(n2).
Topological sort, parallel and distributed algorithms, activity network, CREW PRAM, processor arrays with reconfigurable bus systems.
Q. Gus, J. Ma, K. Iwama and T. Takaoka, "Efficient Parallel and Distributed Topological Sort Algorithms," Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on(PAS), Aizu-Wakamatsu, Fukushima, JAPAN, 1997, pp. 378.