Scheduling trees with large communication delays on two identical processors (Q2464442)
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 5221953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling trees with large communication delays on two identical processors |
scientific article; zbMATH DE number 5221953 |
Statements
Scheduling trees with large communication delays on two identical processors (English)
0 references
20 December 2007
0 references
scheduling
0 references
makespan
0 references
communication delays
0 references
trees
0 references
two processors
0 references
0.8846027851104736
0 references
0.8781579732894897
0 references
0.8714816570281982
0 references
