Scheduling multiprocessor tasks with chain constraints
✍ Scribed by Jacek Błażwicz; Zhen Liu
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 765 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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