Novel broadcasting schemes on cube-connected cycles

Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. This problem appears in applications such as matrix operations, database operation and transitive closure algorithms. The topology considered in this paper is the cube-con...

Full description

Saved in:
Bibliographic Details
Published inPACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005 pp. 629 - 632
Main Authors Jywe-Fei Fang, Chun-Mei Lee, Erh-Ying Yen, Ruei-Xi Chen, Yi-Chun Feng
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Broadcast technology
Broadcasting
Concurrent computing
Educational institutions
Hypercubes
Information management
Local area networks
Multiprocessor interconnection networks
Research and development management
Online AccessGet full text

Cover

More Information
Summary:Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. This problem appears in applications such as matrix operations, database operation and transitive closure algorithms. The topology considered in this paper is the cube-connected cycle that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient computation. In this paper, we present a novel distributed broadcasting scheme for the cube-connected cycles, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message. Moreover, the time steps (i.e., the height of the broadcasting tree) taken by this algorithm is under diameter, which is optimal.
ISBN:9780780391956
0780391950
ISSN:1555-5798
2154-5952
DOI:10.1109/PACRIM.2005.1517368