A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors (Q1208577)
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: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors |
scientific article; zbMATH DE number 166597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors |
scientific article; zbMATH DE number 166597 |
Statements
A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors (English)
0 references
16 May 1993
0 references
clustering of task graphs
0 references
dominant sequence clustering
0 references
scheduling
0 references
parallel architectures
0 references
performance comparison
0 references
0.89423954
0 references
0 references
0.86477387
0 references
0.8633401
0 references
0.86065155
0 references
