𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Design of efficient parallel algorithms on shared memory multiprocessors

✍ Scribed by Qiao Xiangzhen

Book ID
105648336
Publisher
Wuhan University
Year
1996
Tongue
English
Weight
431 KB
Volume
1
Category
Article
ISSN
1007-1202

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

Load-sharing algorithms for parallel dat
Load-sharing algorithms for parallel database processing on shared-everything multiprocessors
✍ Yasuhiro Hirano; Tetsuji Satoh; Ushio Inoue; Katsumi Teranaka πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 665 KB

## Abstract This paper describes new load‐sharing algorithms for parallel database processing. There is a trade‐off between overhead and load unbalance in ordinary algorithms. The proposed algorithms solve the tradeoff by varying the number of tasks allocated at one time, which is fixed in ordinary