๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for LU decomposition on a shared memory multiprocessor

โœ Scribed by John J Buoni; Paul A Farrell; Arden Ruttan

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
564 KB
Volume
19
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel algorithms for QR decomposition
Parallel algorithms for QR decomposition on a shared memory multiprocessor
โœ K. Wright ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 733 KB

Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous

A task duplication based scheduling algo
A task duplication based scheduling algorithm for shared memory multiprocessors
โœ Oh-Han Kang; Si-Gwan Kim ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performan

Macromolecular dynamics on a shared-memo
Macromolecular dynamics on a shared-memory multiprocessor
โœ Robert D. Skeel ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 498 KB

This is a study of the effect of data structures and algorithms on parallelism and vectorization for the molecular dynamics package GROMOS. About 80% of the computing time (for the GROMOS benchmark) is spent on the nonbonded interactions, and an important issue is the method that is used for finding