𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A technique for overlapping computation and communication for block recursive algorithms

✍ Scribed by GUPTA, S. K. S.; HUANG, C.-H.; SADAYAPPAN, P.; JOHNSON, R. W.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
175 KB
Volume
10
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory architecture with a circuit-switched or wormhole routed mesh or a hypercube interconnection network. A mathematical framework based on the tensor product and other matrix operations is used for representing algorithms. Communication-efficient implementations with effectively overlapped computation and communication are achieved by manipulating the mathematical representation using the tensor product algebra. Performance results for FFT programs on the Intel Paragon are presented.

πŸ“œ SIMILAR VOLUMES

COMPUTER SIMULATION TECHNIQUES FOR A MOB
COMPUTER SIMULATION TECHNIQUES FOR A MOBILE SATELLITE COMMUNICATION CHANNEL
✍ LIU, YI-SONG πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 724 KB

This paper gives a brief and systematic presentation of the computer simulation techniques of satellite communications, especially for a mobile satellite channel, based on a summarization of the author's exploration and experience in this area. It includes the equivalent complex baseband notation (E

A sparse multiresolution technique for f
A sparse multiresolution technique for fast capacitance computation
✍ Vikram Jandhyala; Eric Michielssen; Raj Mittra πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 637 KB

A technique for mpidly computing the capacitances of two-dimensional conducting structures is presented in fhis article. The method relies on a sparse multiresolution representation of the interactions between subsections of the conductors. This decomposition is used to substantially reduce the comp

A comparison of overlapping Schwarz meth
A comparison of overlapping Schwarz methods and block preconditioners for saddle point problems
✍ Axel Klawonn; Luca F. Pavarino πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 230 KB

Three domain decomposition methods for saddle point problems are introduced and compared. The first two are blockdiagonal and block-triangular preconditioners with diagonal blocks approximated by an overlapping Schwarz technique with positive definite local and coarse problems. The third is an overl