𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deadline scheduling of multiprocessor tasks

✍ Scribed by J. Blazewicz; M. Drozdowski; D. de Werra; J. Weglarz

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
815 KB
Volume
65
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Deadline-based scheduling of periodic ta
Deadline-based scheduling of periodic task systems on multiprocessors
✍ Anand Srinivasan; Sanjoy Baruah πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 71 KB

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).

General multiprocessor task scheduling
General multiprocessor task scheduling
✍ Jianer Chen; Chung-Yee Lee πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 141 KB

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat

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