This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Graph Algorithms Based Upon Broadcast Communications
December 1990 (vol. 39 no. 12)
pp. 1468-1472

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.

[1] J. I. Capetanakis, "Tree algorithms for packet broadcast channels,"IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.
[2] P. Chaudhuri and R. K. Ghosh, "Parallel algorithms for analyzing activity networks,"BIT, vol. 26, pp. 418-429, 1986.
[3] R. Dechter and L. Kleinrock, "Broadcast communications and distributed algorithms,"IEEE Trans. Comput., vol. C-35, no. 3, pp. 210-219, Mar. 1986.
[4] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, no. 4, pp. 657-675, Nov. 1981.
[5] N. Deo,Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
[6] S. Even,Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
[7] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[8] L. Kucera, "Parallel computation and conflicts in memory access,"Inform. Processing. Lett., vol. 14, no. 2, pp. 93-96, Apr. 1982.
[9] S. Levitan, "Algorithms for broadcast protocol multiprocessor," inProc. 3rd Int. Conf. Distributed Comput. Syst., 1982, pp. 666-671.
[10] S. P. Levitan and C. Foster, "Finding and extremum in a network," inProc. 9th Int. Symp. Comput. Architecture, Apr. 1982, pp. 321-325.
[11] J. M. Marberg and E. Gafni, "Sorting and selection in multi-channel broadcast networks," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 846-850.
[12] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[13] M. J. Quinn and N. Deo, "Parallel graph algorithms,"ACM Comput. Surveys, vol. 16, pp. 319-348, Sept. 1984.
[14] K. V. S. Ramarao, "Distributed sorting on local area networks,"IEEE Trans. Comput., vol. 37, no. 2, pp. 239-243, Feb. 1988.
[15] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[16] R. Tarjan, "Depth-first search and linear graph algorithms,"SIAM J. Comput., vol. 1, no. 2, pp. 146-160, June 1972.
[17] C. B. Yang, "Parallel algorithms based upon broadcasting communications," Ph.D. dissertation, Institute of Computer and Decision Sciences, National Tsing Hua University, Hsinchu, Taiwan, R.O.C., June 1988.

Index Terms:
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.
Citation:
C.-B. Yang, R.C.T. Lee, W.-T. Chen, "Parallel Graph Algorithms Based Upon Broadcast Communications," IEEE Transactions on Computers, vol. 39, no. 12, pp. 1468-1472, Dec. 1990, doi:10.1109/12.61071
Usage of this product signifies your acceptance of the Terms of Use.