Abstract
Recently the star graph has been shown as 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 exist to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. In this paper, we propose an optimal algorithm for one-to-all broadcasting in the star graph. The algorithm can broadcast a message to N processors in O(log2N) 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, we develop an optimal all-to-all broadcasting algorithm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 389-396 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Parallel and Distributed Systems |
| Volume | 3 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 1 1992 |
Fingerprint
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics
Cite this
Optimal Broadcasting on the Star Graph. / Mendia, Victor E.; Sarkar, Dilip.
In: IEEE Transactions on Parallel and Distributed Systems, Vol. 3, No. 4, 01.07.1992, p. 389-396.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Optimal Broadcasting on the Star Graph
AU - Mendia, Victor E.
AU - Sarkar, Dilip
PY - 1992/7/1
Y1 - 1992/7/1
N2 - Recently the star graph has been shown as 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 exist to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. In this paper, we propose an optimal algorithm for one-to-all broadcasting in the star graph. The algorithm can broadcast a message to N processors in O(log2N) 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, we develop an optimal all-to-all broadcasting algorithm.
AB - Recently the star graph has been shown as 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 exist to show its potential as a multiprocessor interconnection network. Many fast and efficient parallel algorithms require broadcasting as a basic step. In this paper, we propose an optimal algorithm for one-to-all broadcasting in the star graph. The algorithm can broadcast a message to N processors in O(log2N) 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, we develop an optimal all-to-all broadcasting algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0026891898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026891898&partnerID=8YFLogxK
U2 - 10.1109/71.149958
DO - 10.1109/71.149958
M3 - Article
VL - 3
SP - 389
EP - 396
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
SN - 1045-9219
IS - 4
ER -