Non-preemptive scheduling to maximize the minimum global inter-completion time (Q1810562)
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 1924699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-preemptive scheduling to maximize the minimum global inter-completion time |
scientific article; zbMATH DE number 1924699 |
Statements
Non-preemptive scheduling to maximize the minimum global inter-completion time (English)
0 references
9 June 2003
0 references
real-time systems
0 references
non-preemptive scheduling
0 references
multiple processors
0 references
resource
0 references
allocation
0 references
load balancing
0 references
0.7476919889450073
0 references
0.7456583380699158
0 references
0.7406759262084961
0 references
0.7406723499298096
0 references
