𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A task duplication based scheduling algorithm for shared memory multiprocessors

✍ Scribed by Oh-Han Kang; Si-Gwan Kim

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
134 KB
Volume
29
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

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 performance of the S2MP algorithm has been observed by comparing the schedule length under various number of processors and the ratio of communication to computation cost.

πŸ“œ SIMILAR VOLUMES

A Task Duplication Based Scalable Schedu
A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems
✍ Sekhar Darbha; Dharma P. Agrawal πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 466 KB

One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt

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

A standard task graph set for fair evalu
A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
✍ Takao Tobita; Hironori Kasahara πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 587 KB

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it di cult to compare the performance of algorithms developed in di erent res