✦ LIBER ✦

The RSCG algorithm on distributed memory architectures

✍ Scribed by Lori Freitag; James Ortega

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 815 KB
Volume: 2
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.1680020503

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance Analysis of the Parallel Kar

Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures

✍ GIOVANNI CESARI; ROMAN MAEDER 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre

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

Towards Structured Parallel Computing on

Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures

✍ Feng Gao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho

Parallel rendering of volumetric data se

Parallel rendering of volumetric data set on distributed-memory architectures

✍ Montani, C. ;Perego, R. ;Scopigno, R. 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 888 KB

A novel parallel algorithm for large-sca

A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm

✍ Hajime Takashima; So Yamada; Shigeru Obara; Kunihiro Kitamura; Shinjiro Inabata; 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

## Abstract We developed a novel parallel algorithm for large‐scale Fock matrix calculation with small locally distributed memory architectures, and named it the “__RT__ parallel algorithm.” The __RT__ parallel algorithm actively involves the concept of integral screening, which is indispensable fo

Run-Time Techniques for Exploiting Irreg

Run-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures

✍ Cong Fu; Tao Yang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Automatic scheduling for directed acyclic graphs (DAG) and its applications for coarse-grained irregular problems such as large n-body simulation have been studied in the literature. However, solving irregular problems with mixed granularities such as sparse matrix factorization is challenging since