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

FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture

โœ Scribed by Haridas, Satchidanand G.; Ziavras, Sotirios G.

Book ID
120531533
Publisher
Taylor and Francis Group
Year
2004
Tongue
English
Weight
305 KB
Volume
19
Category
Article
ISSN
1063-7192

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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