Abstract
A parallel algorithm for depth-first searching of a directed acyclic graph (DAG) on a shared memory model of a SIMD computer is proposed. The algorithm uses two parallel tree traversal algorithms, one for the preorder traversal and the other for therpostorder traversal of an ordered tree. Each of these traversal algorithms has a time complexity ofO(logn) whenO(n) processors are used,n being the number of vertices in the tree. The parallel depth-first search algorithm for a directed acyclic graphG withn vertices has a time complexity ofO((logn)2) whenO(n 2.81/logn) processors are used.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA, (1974).
G. H. Barnes, M. Richard, M. Kato, D. Kuck, D. Slotnik and R. Stokes,The ILLIAC IV Computer, IEEE Trans. Comp., vol. C-17; 8, (1968), pp. 746–757.
A. K. Chandra,Maximal parellelism in matrix multiplication, RC-6193, IBM TJW Res. Centre, (1976).
D. M. Eckstein and D. Alton,Parallel graph processing using depth-first search, Proc. Symp. Theo. Comp. Sci., (1977).
F. Gavril,Merging with parallel processors, CACM, vol. 18, (1975), pp. 588–591.
E. Horowitz and S. Sahni,Fundamentals of Data Structures, Comp. Sci. Press Inc., Potomac, MD, (1977).
J. Ja' Ja' and J. Simon,Parallel algorithms in graph theory: Planarity testing, SIAM J. Comput., vol. 11; 2, (1982), pp. 314–328.
P. Kogge,Parallel solution of recurrence problems, IBM J. Res. and Dev., vol. 18, (1974), pp. 138–148.
K. Maruyama,On the parallel evaluation of polynomials, IEEE Trans. Comp., vol. C-22; 1, (1973), pp. 2–5.
F. P. Preparata,New parallel sorting schemes, IEEE Trans. Comp., vol. C-27; 7, (1978), pp. 669–673.
E. Reghbati and D. G. Corneil,Parallel computations in graph theory, SIAM J. Comput., vol. 7; 2, (1978), pp. 230–237.
C. Savage and J. Ja' Ja',Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput., vol. 10; 4, (1981), pp. 682–691.
V. Strassen,Gaussian elimination is not optimal, Num. Math., vol. 13; 4, (1969), pp. 354–356.
R. J. Swan, S. Fuller and D. Siewiorek,Cm* a modular multi-microprocessor, Proc. AFIPS National, Comp. Conf., vol. 46, (1977), pp. 637–644.
R. E. Tarjan,Depth-first search and linear graph algorithms, SIAM J. Comput., vol. 1; 2, (1972), pp. 146–166.
R. E. Tarjan,Finding dominators in a directed graph, SIAM J. Comput., vol. 3; 1, (1974), pp. 62–89.
J. Wyllie,The complexity of parallel computations, Ph.D. Thesis, Tech. Rep. 79-387, Cornell University, Ithaca, NY, (1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ghosh, R.K., Bhattacharjee, G.P. A parallel search algorithm for directed acyclic graphs. BIT 24, 133–150 (1984). https://doi.org/10.1007/BF01937481
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01937481