𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for semi on-line multiprocessor scheduling problems

✍ Scribed by He Yong; Yang Qi-fan; Tan Zhi-yi; Yao En-yu

Publisher
SP Zhejiang University Press
Year
2002
Tongue
English
Weight
407 KB
Volume
3
Category
Article
ISSN
1009-3095

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