Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories (Q3680272)
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 3902031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories |
scientific article; zbMATH DE number 3902031 |
Statements
Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories (English)
0 references
1985
0 references
performance
0 references
scheduling independent jobs
0 references
algorithm
0 references
minimum mean-flow time
0 references
0.8141468167304993
0 references
0.7758684754371643
0 references
0.7684054970741272
0 references
