Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299)
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 1252891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors |
scientific article; zbMATH DE number 1252891 |
Statements
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (English)
0 references
22 April 1999
0 references
biprocessor task
0 references
edge coloring
0 references
makespan
0 references
NP-completeness
0 references
polynomial algorithm
0 references
precedence constraints
0 references
total completion time
0 references
0.90756077
0 references
0.90726656
0 references
0.9009597
0 references
0.89392775
0 references
0.8937106
0 references
0.8928181
0 references
