𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling Independent Multiprocessor Tasks

✍ Scribed by A. K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis

Book ID
120136515
Publisher
Springer
Year
2002
Tongue
English
Weight
214 KB
Volume
32
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ 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
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