✦ LIBER ✦

A new parallel matrix multiplication algorithm on distributed-memory concurrent computers

✍ Scribed by Choi, Jaeyoung

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 139 KB
Volume: 10
Category: Article
ISSN: 1040-3108
DOI: 10.1002/(sici)1096-9128(199807)10:8<655::aid-cpe369>3.0.co;2-o

No coin nor oath required. For personal study only.

✦ Synopsis

We present a new fast and scalable matrix multiplication algorithm called DIMMA (distribution-independent matrix multiplication algorithm) for block cyclic data distribution on distributed-memory concurrent computers. The algorithm is based on two new ideas; it uses a modified pipelined communication scheme to overlap computation and communication effectively, and exploits the LCM block concept to obtain the maximum performance of the sequential BLAS (basic linear algebra subprograms) routine in each processor even when the block size is very small or very large. The algorithm is implemented and compared with SUMMA on the Intel Paragon computer.

📜 SIMILAR VOLUMES

Parallel implementation of a ray tracing

Parallel implementation of a ray tracing algorithm for distributed memory parallel computers

✍ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Numerical simulation of fluid dynamic pr

Numerical simulation of fluid dynamic problems on distributed memory parallel computers

✍ Pirozzi, Maria A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 2 views

This paper describes the parallel implementation of a numerical model for the simulation of problems from fluid dynamics on distributed memory multiprocessors. The basic procedure is to apply a fully explicit upwind finite difference approximation on a staggered grid. A theoretical time complexity a

Parallel realizations of Kanerva's spars

Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer

✍ Hämäläinen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB 👁 2 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation