𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Run-time support For parallel functional programming on shared-memory multiprocessors

✍ Scribed by Lee Ching-Cheng; H.A. Fatmi

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
813 KB
Volume
16
Category
Article
ISSN
0164-1212

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

Efficient support for fine-grain paralle
Efficient support for fine-grain parallelism on shared-memory machines
✍ LOWENTHAL, DAVID K.; FREEH, VINCENT W.; ANDREWS, GREGORY R. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 134 KB πŸ‘ 2 views

A coarse-grain parallel program typically has one thread (task) per processor, whereas a finegrain program has one thread for each independent unit of work. Although there are several advantages to fine-grain parallelism, conventional wisdom is that coarse-grain parallelism is more efficient. This p

Run-Time Techniques for Exploiting Irreg
Run-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures
✍ Cong Fu; Tao Yang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 372 KB

Automatic scheduling for directed acyclic graphs (DAG) and its applications for coarse-grained irregular problems such as large n-body simulation have been studied in the literature. However, solving irregular problems with mixed granularities such as sparse matrix factorization is challenging since