
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 14681472, December, 1990.  
BibTex  x  
@article{ 10.1109/12.61071, author = {C.B. Yang and R.C.T. Lee and W.T. Chen}, title = {Parallel Graph Algorithms Based Upon Broadcast Communications}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {12}, issn = {00189340}, year = {1990}, pages = {14681472}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.61071}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Parallel Graph Algorithms Based Upon Broadcast Communications IS  12 SN  00189340 SP1468 EP1472 EPD  14681472 A1  C.B. Yang, A1  R.C.T. Lee, A1  W.T. Chen, PY  1990 KW  parallel graph algorithms; broadcast communications; singlechannel broadcast communication model; topological ordering; connected component problem; breadthfirst search; depthfirst search; message switching; packet switching; parallel algorithms. VL  39 JA  IEEE Transactions on Computers ER   
Some common guidelines that can be used to design parallel algorithms under the singlechannel broadcast communication model are presented. Several graph problems are solved, including topological ordering, the connected component problem, breadthfirst search, and depthfirst 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. IT25, pp. 505515, Sept. 1979.
[2] P. Chaudhuri and R. K. Ghosh, "Parallel algorithms for analyzing activity networks,"BIT, vol. 26, pp. 418429, 1986.
[3] R. Dechter and L. Kleinrock, "Broadcast communications and distributed algorithms,"IEEE Trans. Comput., vol. C35, no. 3, pp. 210219, Mar. 1986.
[4] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, no. 4, pp. 657675, Nov. 1981.
[5] N. Deo,Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: PrenticeHall, 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: McGrawHill, 1984.
[8] L. Kucera, "Parallel computation and conflicts in memory access,"Inform. Processing. Lett., vol. 14, no. 2, pp. 9396, Apr. 1982.
[9] S. Levitan, "Algorithms for broadcast protocol multiprocessor," inProc. 3rd Int. Conf. Distributed Comput. Syst., 1982, pp. 666671.
[10] S. P. Levitan and C. Foster, "Finding and extremum in a network," inProc. 9th Int. Symp. Comput. Architecture, Apr. 1982, pp. 321325.
[11] J. M. Marberg and E. Gafni, "Sorting and selection in multichannel broadcast networks," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 846850.
[12] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGrawHill, 1987.
[13] M. J. Quinn and N. Deo, "Parallel graph algorithms,"ACM Comput. Surveys, vol. 16, pp. 319348, Sept. 1984.
[14] K. V. S. Ramarao, "Distributed sorting on local area networks,"IEEE Trans. Comput., vol. 37, no. 2, pp. 239243, Feb. 1988.
[15] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: PrenticeHall, 1977.
[16] R. Tarjan, "Depthfirst search and linear graph algorithms,"SIAM J. Comput., vol. 1, no. 2, pp. 146160, 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.