Overlapped-Two-Phase Broadcast and Its Evaluation on a Cluster of PCs

Noritaka SHIGEI  Masahiro KANDA  

IEICE TRANSACTIONS on Information and Systems   Vol.E85-D   No.6   pp.1039-1042
Publication Date: 2002/06/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Computer Systems
one-to-all broadcast,  two-phase broadcast,  tree broadcast,  cluster of PCs,  MPI,  

Full Text: PDF(336.4KB)>>
Buy this Article

In this letter, we consider one-to-all broadcast on distributed memory parallel computers based on message-passing, such as cluster of WSs or PCs. We present an efficient broadcast algorithm, called overlapped-two-phase broadcast (O2PB), that is an enhanced version of two-phase broadcast (2PB). The O2PB algorithm is compared with other algorithms, such as linear broadcast, tree broadcast and 2PB algorithms. According to our theoretical and experimental results, when the size of message to be broadcasted is large, the O2PB algorithm is fastest among all the algorithms. The O2PB algorithm is approximately 20% faster than the 2PB algorithm.