Near-optimal all-to-all broadcast in multidimensional all-port meshes and tori

Author

Yang, Yuanyuan ; Wang, Jianchao

Author_Institution

Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY, USA

Volume

13

Issue

2

fYear

2002

fDate

2/1/2002 12:00:00 AM

Firstpage

128

Lastpage

141

Abstract

All-to-all communication is one of the most dense collective communication patterns and occurs in many important applications in parallel and distributed computing. In this paper, we present a new all-to-all broadcast algorithm in multidimensional all-port mesh and torus networks. We propose a broadcast pattern which ensures a balanced traffic load in all dimensions in the network so that the all-to-all broadcast algorithm can achieve a very tight near-optimal transmission time. The algorithm also takes advantage of overlapping of message switching time and transmission time, and the total communication delay asymptotically matches the lower bound of all-to-all broadcast. Finally, the algorithm is conceptually simple and symmetrical for every message and every node so that it can be easily implemented in hardware and achieves the near-optimum in practice

Keywords

computational complexity; distributed processing; multiprocessor interconnection networks; all-to-all broadcast; all-to-all communication; broadcast tree; collective communication; distributed computing; gossip; interprocessor communication; mesh; parallel computing; routing; torus; Application software; Broadcasting; Communication switching; Computer Society; Delay effects; Distributed computing; Hardware; Multidimensional systems; Senior members; Telecommunication traffic;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.983941

Filename

983941