Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272)
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: Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays |
scientific article |
Statements
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (English)
0 references
1988
0 references
data routing
0 references
two-dimensional systolic arrays
0 references
linear programs
0 references
VLSI
0 references
0.85343856
0 references
0.8322351
0 references
0.8311572
0 references
0.83071613
0 references
0.8282732
0 references
0.82757175
0 references
