𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel ILP for distributed-memory architectures

✍ Scribed by Nuno A. Fonseca; Ashwin Srinivasan; Fernando Silva; Rui Camacho


Book ID
106453194
Publisher
Springer
Year
2008
Tongue
English
Weight
544 KB
Volume
74
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Pseudospectral correlation methods on di
✍ 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
✍ 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 Genehunter: implementation of a
✍ Gavin C. Conant; Steven J. Plimpton; William Old; Andreas Wagner; Pamela R. Fain πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 186 KB

We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computation and memory requirements of the analysis. We discuss an implementation of the algorithm in the Genehunter linkage ana

Performance Analysis of the Parallel Kar
✍ 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