Methods for heterogeneous and reconfigurable task partitioning based on directed acyclic graphs (Q2917908)
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: Methods for heterogeneous and reconfigurable task partitioning based on directed acyclic graphs |
scientific article; zbMATH DE number 6091630
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Methods for heterogeneous and reconfigurable task partitioning based on directed acyclic graphs |
scientific article; zbMATH DE number 6091630 |
Statements
5 October 2012
0 references
directed acyclic graph
0 references
heterogeneous computing task
0 references
reconfigurable architecture
0 references
task partitioning
0 references
0.8820498
0 references
0.8747389
0 references
0.8718929
0 references
0.86972475
0 references
Methods for heterogeneous and reconfigurable task partitioning based on directed acyclic graphs (English)
0 references
