Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Processor bounding for an efficient non-preemptive task scheduling algorithm |
scientific article; zbMATH DE number 7137258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Processor bounding for an efficient non-preemptive task scheduling algorithm |
scientific article; zbMATH DE number 7137258 |
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
