Optimal folding of data flow graphs based on finite projective geometry using vector space partitioning (Q2874051)
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 6251178
| 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 6251178 |
Statements
28 January 2014
0 references
vector space partitioning
0 references
finite projective geometry
0 references
parallel scheduling
0 references
semi-parallel architecture
0 references
Optimal folding of data flow graphs based on finite projective geometry using vector space partitioning (English)
0 references
