𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple algorithms for multiprocessor scheduling to meet deadlines

✍ Scribed by Jacek Błazewicz

Book ID
113161907
Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
320 KB
Volume
6
Category
Article
ISSN
0020-0190

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

Mixed satisfiability tests for multiproc
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
✍ F. Tercinet; C. Lenté; E. Néron 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We investigate classical satisÿability tests for P|ri; di|-. Our motivation is to use the complementarity of classical preemptive relaxation and energetic reasoning. Thus minimum capacity constraints, based on the notion of mandatory parts of activities, are added to the classical max-ow formulation