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

Exploiting fine-grain parallelism on dataflow architectures

โœ Scribed by Guang R Gao

Book ID
103595479
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
981 KB
Volume
13
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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