Optimum broadcasting algorithms in (n, k)-star graphs using spanning trees

Authors:
Jinli Li;Manli Chen;Yonghong Xiang;Shaowen Yao
Affiliations:
Kunming Electric Power Supply Bureau, YNPG, Kunming, China;Natioanl Computer network Emergency Response Technical Team/Coordination Center-Yunnan Branch, Kunming, China;Department of Computer Science, University of Durham, Science Labs, Durham, UK and School of Software, Yunnan University, Kunming, China;Department of Computer Science, University of Durham, Science Labs, Durham, UK
Venue:
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Year:
2007

Citing 4
Cited 1

Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
The (n,k)-star graph: a generalized star graph

Information Processing Letters
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

IEEE Transactions on Computers
Ring Embedding in Faulty (n, k)-star Graphs

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a multiprocessor network, sending a packet typically refers to start-up time and transmission time. To optimize these two times, as opposed to earlier solutions, a spanning tree and multiple spanning trees are constructed to solve four types of broadcasting problems in an (n, k)-star graph: one-to-all or all-to-all broadcasting with either one-port or all-port communication model, respectively. Since the proposed spanning tree has an optimal height, both one to-all and all-to-all broadcasting algorithms achieve nearly optimal start-up time and transmission time under all-port model and one-port model, and optimal transmission time under one-port model. By using multiple spanning trees, both one-to-all and all-to-all algorithms achieve nearly optimal transmission time under all-port model and one-port model.