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

A Robust Compile Time Method for Scheduling Task Parallelism on Distributed Memory Machines

โœ Scribed by Sekhar Darbha; Santosh Pande

Book ID
110258358
Publisher
Springer US
Year
1998
Tongue
English
Weight
229 KB
Volume
12
Category
Article
ISSN
0920-8542

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

Compiler Algorithms for Optimizing Local
Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines
โœ M. Kandemir; J. Ramanujam; A. Choudhary ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB

Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar

Global Optimization for Mapping Parallel
Global Optimization for Mapping Parallel Image Processing Tasks on Distributed Memory Machines
โœ Cheolwhan Lee; Yuan-Fang Wang; Tao Yang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 565 KB

Many parallel algorithms and library routines for computer vision and image processing (CVIP) tasks on distributed-memory multiprocessors are available. The typical image distribution may use column, row, and block based mapping. Integrating a set of library routines for a CVIP application requires