All-to-all personalized communication in a wormhole-routed torus

Author

Tseng, Yu-Chee ; Gupta, Sandeep K S

Author_Institution

Dept. of Comput. Sci., Chung Hua Polytech. Inst., Hsin-Chu, Taiwan

Volume

7

Issue

5

fYear

1996

fDate

5/1/1996 12:00:00 AM

Firstpage

498

Lastpage

505

Abstract

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions-that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing

Keywords

message passing; multiprocessing systems; multiprocessor interconnection networks; parallel architectures; all-to-all personalized communication; collective communication; complete exchange algorithms; dense communication patterns; dimension-ordered minimum routing; e-cube; multicomputer network; parallel computing; wormhole-routed torus; wormhole-routing capability; Broadcasting; Concurrent computing; Delay; Fast Fourier transforms; Heart; Intelligent networks; Load management; Routing; Table lookup; Unicast;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.503775

Filename

503775