Issue No. 04 - July (1992 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.149958
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.
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
D. Sarkar, V.E. Mendia, "Optimal Broadcasting on the Star Graph", IEEE Transactions on Parallel & Distributed Systems, vol. 3, no. , pp. 389-396, July 1992, doi:10.1109/71.149958