A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast gossiping for the hypercube
SIAM Journal on Computing
SIAM Journal on Computing
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
A broadcasting algorithm in star graph interconnection networks
Information Processing Letters
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Log-Time Multicast to Local Vertices in the Star Graph
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Mathematical performance modelling of stretched hypercubes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Hi-index | 14.98 |
This paper studies two neighborhood information dissemination problems in the star graph (n-star): The neighborhood broadcast problem (NBP) is the problem of disseminating a message from the source vertex to all the vertices adjacent to the source vertex and the neighborhood gossiping problem (NGP) is the problem of exchanging messages among all neighboring vertices in the given graph. We propose two neighborhood information dissemination schemes in n-star under the single-port, half-duplex model: The first scheme completes a neighborhood broadcast in $1.5\log_2 n + O(1)$ time units and the second scheme completes a neighborhood gossiping in $2.88\log_2 n + o(\log n)$ time units. We also derive a lower bound on the neighborhood gossiping of $2.88\log_2 n + O(1)$ time units, which implies that the latter scheme is optimal with respect to the leading term.