✦ LIBER ✦

Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication

✍ Scribed by Alan Edelman

Book ID: 103918318
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 390 KB
Volume: 11
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(91)90039-c

No coin nor oath required. For personal study only.

✦ Synopsis

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 that of the local address. These exchanges occur typically in both matrix transposition and bit reversal for the fast Fourier transform.

📜 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

Efficient indirect all-to-all personaliz

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

✍ Naijie Gu 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 284 KB