An efficient heuristic for code partitioning (Q1978622)
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: An efficient heuristic for code partitioning |
scientific article; zbMATH DE number 1454364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient heuristic for code partitioning |
scientific article; zbMATH DE number 1454364 |
Statements
An efficient heuristic for code partitioning (English)
0 references
4 June 2000
0 references
distributed memory multiprocessor (DMM)
0 references
directed acyclic graph (DAG)
0 references
processing element (PE)
0 references
partition
0 references
task
0 references
critical path
0 references
task graph
0 references
task merging
0 references
task clustering
0 references
0.9532458186149596
0 references
