JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on

YR 1997

VO 00

IS

SP 378

TI Efficient Parallel and Distributed Topological Sort Algorithms

A1 Qian-Ping Gus,

A1 Jun Ma,

A1 Kazuo Iwama,

A1 Tadao Takaoka,

K1 Topological sort

K1 parallel and distributed algorithms

K1 activity network

K1 CREW PRAM

K1 processor arrays with reconfigurable bus systems.

AB 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).

PB IEEE Computer Society, [URL:http://www.computer.org]

SN

LA English

DO 10.1109/AISPAS.1997.581703

LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581703