DocumentCode
1405637
Title
Generating an efficient broadcast sequence using reflected Gray codes
Author
Moore, Jason A. ; Quinn, Michael J.
Author_Institution
Dept. of Comput. Sci., US Air Force Acad., Colorado Springs, CO, USA
Volume
8
Issue
11
fYear
1997
fDate
11/1/1997 12:00:00 AM
Firstpage
1117
Lastpage
1122
Abstract
One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This imbalance can degrade performance when a data-parallel algorithm requires a series of broadcasts from different source processors. In this paper, we show that using a reflected Gray code to order broadcasts minimizes the communication time
Keywords
Gray codes; broadcasting; communication complexity; multiprocessing systems; binomial trees; broadcast sequence; broadcasting; communication algorithms; communication time; data-parallel algorithm; multicomputers; parallel processing; reflected Gray codes; Bandwidth; Broadcasting; Computer Society; Computer architecture; Computer science; Hypercubes; Parallel processing; Programming profession; Reflective binary codes; Tree graphs;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.642946
Filename
642946
Link To Document