Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules (Q2369680)
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: Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules |
scientific article; zbMATH DE number 5024968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules |
scientific article; zbMATH DE number 5024968 |
Statements
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules (English)
0 references
22 May 2006
0 references
modular linear systolic algorithms
0 references
fully pipelined
0 references
partially pipelined
0 references
matrix product
0 references
space-time complexity
0 references
0.7713127136230469
0 references
0.7587177157402039
0 references
0.7581671476364136
0 references
