OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING (Q5411798)
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: OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING |
scientific article; zbMATH DE number 6288211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING |
scientific article; zbMATH DE number 6288211 |
Statements
OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING (English)
0 references
25 April 2014
0 references
vector space partitioning
0 references
finite projective geometry
0 references
parallel scheduling
0 references
semi-parallel architecture
0 references
