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 the normal view instead:
scientific article; zbMATH DE number 7137258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8166422247886658
0 references
0.7983201742172241
0 references
0.7968460321426392
0 references
0.7944942116737366
0 references
