Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Processor bounding for an efficient non-preemptive task scheduling algorithm |
scientific article |
Statements
Processor bounding for an efficient non-preemptive task scheduling algorithm (English)
0 references
27 November 2019
0 references
non-preemptive scheduling
0 references
multiprocessor scheduling
0 references
lower and upper bounds of processors' number
0 references
