𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Portable, parallel transformation: Distributed-Memory approach

✍ Scribed by Covick, Lawrence A.; Sando, Kenneth M.

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
817 KB
Volume
17
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

The four-index transformation has a high ratio of data transfer to computation making it a potential "bottleneck" for parallel correlation energy determination. We present formulas for the communication times on different parallel architectures for an algorithm that is primarily designed for distributed-memory machines. We also implemented the algorithm on two shared-memory parallel computers, the Encore Multimax and the Alliant FX-8, and measured wall clock times for several problem sizes and processor configurations.

πŸ“œ SIMILAR VOLUMES

Four-Index transformation on distributed
Four-Index transformation on distributed-memory parallel computers
✍ Lawrence A. Covick; Kenneth M. Sando πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 834 KB

Because it has 0(N5) operations, a low computation to data transfer ratio, and is a compact piece of code, the four-index transformation is a good test case for parallel algorithm development of electronic structure calculations. We present an algorithm primarily designed for distributed-memory mach

Parallel MP2-energy evaluation: Simulate
Parallel MP2-energy evaluation: Simulated shared memory approach on distributed memory parallel machines
✍ Limaye, Ajay C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 1 views

A parallel algorithm for four-index transformation and MP2 energy evaluation, Ε½ . for distributed memory parallel MIMD machines is presented. The underlying serial algorithm for the present parallel effort is the four-index transform. The scheme works through parallelization over AO integrals and, t

Scalable Parallel Matrix Multiplication
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
✍ Keqin Li πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 392 KB

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel

Pseudospectral correlation methods on di
Pseudospectral correlation methods on distributed memory parallel architectures
✍ Todd J. Martinez; Emily A. Carter πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 565 KB

We describe an efficient implementation of the pseudospectral multi-reference single-and double-excitation configuration interaction method on a distributed memory parallel architecture. Near-linear speedups are achieved up to 16 processors for a single-reference test case, demonstrating that pseudo