Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (Q3706490)
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 3934396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints |
scientific article; zbMATH DE number 3934396 |
Statements
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (English)
0 references
1985
0 references
memory requirement
0 references
parallel processors
0 references
algorithm
0 references
0.88845294713974
0 references
0.8590089678764343
0 references
0.845524787902832
0 references
0.8419629335403442
0 references
