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

Deadline-based scheduling of periodic task systems on multiprocessors

โœ Scribed by Anand Srinivasan; Sanjoy Baruah

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
71 KB
Volume
84
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem. We show that our algorithm successfully schedules on m processors any periodic task system with utilization at most m 2 /(2m -1).

๐Ÿ“œ SIMILAR VOLUMES

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
A comparison of heuristics for schedulin
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
โœ A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know

Minimal schedulability interval for real
Minimal schedulability interval for real-time systems of periodic tasks with offsets
โœ Annie Choquet-Geniet; Emmanuel Grolleau ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot de