Sciweavers

Share
ASIAMS
2007
IEEE

Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree

10 years 7 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools for some important communication problems such as broadcasting and personalized communications. When it refers to communications, it always involves two costs. Specifically, sending a packet of b bytes along a link takes cs bTT + time, where sT is the time to initialize (or start-up) the communication link and cT is the latency to transmit a byte. To optimize these costs, a spanning tree is constructed to solve one-to-all broadcasting problem in an (n, k)-arrangement graph. Since the spanning tree has an optimal height, our algorithm achieves optimal start-up cost skn TADO )1)(( , − and transmission cost )( )( c knk m TO − under the all-port model, and optimal transmission cost )( cmTO under the oneport model.
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ASIAMS
Authors Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zhou
Comments (0)
books