Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules.
Clémentin Tayou DjamégniPublished in: J. Parallel Distributed Comput. (2006)
Keyphrases
- computational cost
- data structure
- computational complexity
- worst case
- space complexity
- optimization problems
- scheduling problem
- image registration
- memory requirements
- affine invariant
- perturbation theory
- learning algorithm
- complexity measures
- lower complexity
- linear systems
- linear models
- computationally efficient
- linear programming
- significant improvement
- image sequences
- social networks