𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A collection of parallel linear equations routines for the Denelcor HEP

✍ Scribed by Jack J. Dongarra; Robert E. Hiromoto

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
458 KB
Volume
1
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

This paper describes the implementation and performance results for a few standard linear algebra routines on the Denelcor HEP computer. The algorithms used here are based on high-level modules that facilitate portability and perform efficiently in a xvide range of environments:The modules are chosen to be of a large enough computational granularity so that reasonably optimum performance may be insured. The design of algorithms with such fundamental modules in mind will also facilitate their replacement by others more suited to gain the desired performance on a particular computer architecture.

πŸ“œ SIMILAR VOLUMES

Divide and conquer: a parallel algorithm
Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations
✍ Stefan Bondeli πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 655 KB

Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com

Fast Parallel Algorithms for Solving Tri
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube
✍ O.H. Ibarra; M.H. Kim πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec