DocumentCode :
900589
Title :
On general results for all-to-all broadcast
Author :
Chen, Ming-Syan ; Chen, Jeng-Chun ; Yu, Philip S.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume :
7
Issue :
4
fYear :
1996
fDate :
4/1/1996 12:00:00 AM
Firstpage :
363
Lastpage :
370
Abstract :
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of information to all other nodes in the system. In this paper, we develop all-to-all broadcast schemes by dealing with two classes of schemes. A prior scheme based on generation of minimal complete sets is first described, and then a new scheme based on propagation of experts is developed. The former always completes the broadcasting in the minimal number of steps and the latter is designed to minimize the number of messages. Performance of these two classes of schemes is comparatively analyzed. The all-to-all broadcast scheme desired can be derived by combining the advantages of these two classes of schemes
Keywords :
message passing; multiprocessor interconnection networks; NODUP; all-to-all broadcast; communication steps; expert propagation; message passing; minimal complete sets; propagation of experts; Broadcasting; Clocks; Computer Society; Distributed computing; Electronic mail; Message passing; Performance analysis; Protocols; Senior members; Synchronization;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/71.494631
Filename :
494631
Link To Document :
بازگشت