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

Fine grain scheduler for shared-memory multiprocessor systems

โœ Scribed by Shieh, J.-J.; Lee, Y.-C.; Chen, H.-R.

Book ID
114448165
Publisher
The Institution of Electrical Engineers
Year
1995
Tongue
English
Weight
676 KB
Volume
142
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Integrating Fine-Grained Message Passing
Integrating Fine-Grained Message Passing in Cache Coherent Shared Memory Multiprocessors
โœ David K. Poulsen; Pen-Chung Yew ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

This paper considers the use of data prefetching and an alternative mechanism, data forwarding, for reducing memory latency caused by interprocessor communication in cache coherent, shared memory multiprocessors. Data prefetching is accomplished by using a multiprocessor software pipelined algorithm

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

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