This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Broadcasting on the Star Graph
July 1992 (vol. 3 no. 4)
pp. 389-396
ASCII Text
x 
 
V.E. Mendia, D. Sarkar, "Optimal Broadcasting on the Star Graph," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 389-396, July, 1992.
 
 
BibTex
x
 
@article{ 10.1109/71.149958,
author = {V.E. Mendia and D. Sarkar},
title = {Optimal Broadcasting on the Star Graph},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {3},
number = {4},
issn = {1045-9219},
year = {1992},
pages = {389-396},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.149958},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Optimal Broadcasting on the Star Graph
IS - 4
SN - 1045-9219
SP389
EP396
EPD - 389-396
A1 - V.E. Mendia,
A1 - D. Sarkar,
PY - 1992
KW - Index Termsmessage broadcasting; recursive partitioning; star graph; n-cube; symmetry; faulttolerant; multiprocessor interconnection network; parallel algorithms; optimal algorithm;one-to-all broadcasting; all-to-all broadcasting algorithm; computational complexity;graph theory; multiprocessor interconnection networks; parallel algorithms
VL - 3
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
The star graph has been show to be an attractive alternative to the widely used n-cube. Like the n-cube, the star graph possesses rich structure and symmetry as well as fault tolerant capabilities, but has a smaller diameter and degree. However, very few algorithms exists to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. An optimal algorithm for one-to-all broadcasting in the star graph is proposed. The algorithm can broadcast a message to N processors in O(log/sub 2/ N) time. The algorithm exploits the rich structure of the star graph and works by recursively partitioning the original star graph into smaller star graphs. In addition, an optimal all-to-all broadcasting algorithm is developed.

[1] S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks,"IEEE Trans. Comput., vol. 38, pp. 555-566, 1989.
[2] S. B. Akers, D. Harel, and B. Krisnamurthy, "The star graph: An attractive alternative to the n-cube," inProc. Int. Conf. Parallel Processing, 1987, pp. 393-400.
[3] Selim G. Akl,The Design and Analysis of Parallel Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[4] Almasi, G.S., and Gottlieb, A.,Highly Parallel Computing, Benjamin/Cummings, Redwood City, Calif., 1989 [survey text: parallel architectures (Connection Machine, GF11, hypercubes, shared-memory multiprocessors, Ultra, RP3, Cedar), programming difficulties, and compiler methods].
[5] T-y Feng, "A survey of interconnection networks"IEEE Comput. Mag., vol. 14, pp. 12-27, 1981.
[6] S. L. Johnsson and C. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, 1989.
[7] H. B. Laufer,Discrete Mathematics and Applied Modern Algebra. Boston, MA: Prindle, Weber and Schmidt, 1984.
[8] P. Ramanathan and K. G. Shin, "Reliable broadcast in hypercube multicomputers,"IEEE Trans. Comput., vol. 37, pp. 1654-1657, 1988.

Index Terms:
Index Termsmessage broadcasting; recursive partitioning; star graph; n-cube; symmetry; faulttolerant; multiprocessor interconnection network; parallel algorithms; optimal algorithm;one-to-all broadcasting; all-to-all broadcasting algorithm; computational complexity;graph theory; multiprocessor interconnection networks; parallel algorithms
Citation:
V.E. Mendia, D. Sarkar, "Optimal Broadcasting on the Star Graph," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 389-396, July 1992, doi:10.1109/71.149958
Usage of this product signifies your acceptance of the Terms of Use.