๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient indirect all-to-all personalized communication on rings and 2-D tori

โœ Scribed by Naijie Gu

Book ID
105666114
Publisher
Springer
Year
2001
Tongue
English
Weight
284 KB
Volume
16
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal Algorithms for All-to-All Person
Optimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori
โœ Chi Chung Lam; C.-H. Huang; P. Sadayappan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

All-to-all personalized communication is a basic communication operation in a parallel computing environment. In this operation, each processor sends a distinct message to every other processor. It is used in several parallel algorithms, such as for the fast Fourier transform. This paper presents ne

Optimal matrix transposition and bit rev
Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication
โœ Alan Edelman ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 390 KB

In a hypercuhe multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercuhe node address and a local memory address. Here we describe an optimal algorithm for performing the communication described by exchanging the bits of the node address with t