An optimal broadcasting algorithm for de bruijn network dBG(d,k)

Authors:
Ngoc Chi Nguyen;Sungyoung Lee
Affiliations:
Computer Engineering Department, Kyung Hee Univerity, Gyeonggi, Korea;Computer Engineering Department, Kyung Hee Univerity, Gyeonggi, Korea
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 4
Cited 0

Routing and Transmitting Problems in de Bruijn Networks

IEEE Transactions on Computers
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Optimal broadcasting in binary de Bruijn networks and hyper-deBruijn networks

IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium
Optimal fault-tolerant communication algorithms on product networks using spanning trees

SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorithms can only work in binary dBG. In this paper, we investigate broadcasting in bidirectional dBG for a degree greater than or equal to two. A distributed broadcast algorithm for one-to-all broadcasting in the all port communication is proposed for dBG(d,k).