On the minimum number of processors for scheduling problems with communication delays (Q1290161)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the minimum number of processors for scheduling problems with communication delays |
scientific article; zbMATH DE number 1299359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum number of processors for scheduling problems with communication delays |
scientific article; zbMATH DE number 1299359 |
Statements
On the minimum number of processors for scheduling problems with communication delays (English)
0 references
10 June 1999
0 references
interprocessor communication delays
0 references
minimum number of processors
0 references
makespan
0 references
upper bounds
0 references
0.9088103771209716
0 references
0.8544378280639648
0 references
0.8404616117477417
0 references
0.8378844857215881
0 references
