Assigning dependency graphs onto processor networks (Q757023)
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 4193094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Assigning dependency graphs onto processor networks |
scientific article; zbMATH DE number 4193094 |
Statements
Assigning dependency graphs onto processor networks (English)
0 references
1991
0 references
task assignment
0 references
scheduling
0 references
heuristic
0 references
dependency graphs
0 references
depth-first breadth-next (DFBN) search
0 references
0.7950876951217651
0 references
0.7880063652992249
0 references
0.7789638042449951
0 references
