Issue No. 12 - December (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.61071
<p>Some common guidelines that can be used to design parallel algorithms under the single-channel broadcast communication model are presented. Several graph problems are solved, including topological ordering, the connected component problem, breadth-first search, and depth-first search. If an ideal conflict resolution scheme is used, all of the algorithms require O(n) time by using n processors. Under such a situation, the algorithms are all optimal. If a realistic conflict resolution is used, the algorithms require O(n log n) time by using n/log n processors. For both cases, all of the algorithms achieve optimal speedups.</p>
parallel graph algorithms; broadcast communications; single-channel broadcast communication model; topological ordering; connected component problem; breadth-first search; depth-first search; message switching; packet switching; parallel algorithms.
C.-B. Yang, W.-T. Chen, R.C.T. Lee, "Parallel Graph Algorithms Based Upon Broadcast Communications", IEEE Transactions on Computers, vol. 39, no. , pp. 1468-1472, December 1990, doi:10.1109/12.61071