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

A performance study of multiprocessor task scheduling algorithms

โœ Scribed by Shiyuan Jin; Guy Schiavone; Damla Turgut

Publisher
Springer US
Year
2007
Tongue
English
Weight
452 KB
Volume
43
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling algorithm for nonpreemptive m
Scheduling algorithm for nonpreemptive multiprocessor tasks
โœ J.-F. Lin; S.-J. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 619 KB

This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only "one" processor whenever it is in processing. In our multip

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

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

Deadline scheduling of multiprocessor ta
Deadline scheduling of multiprocessor tasks
โœ J. Blazewicz; M. Drozdowski; D. de Werra; J. Weglarz ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 815 KB