Optimal systolic array algorithms for tensor product

In this paper we examine the computational complexity of optimal systolic array algorithms for tensor product. We provide a time minimal schedule that meets the computed processor lower and upper bounds including one for tensor product. Our principle contribution is to find lower and upper bounds in...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 168; no. 1; pp. 496 - 518
Main Author Mishra, P.K.
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 01.09.2005
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computational complexity
Computer science; control theory; systems
Exact sciences and technology
Lower and upper bounds
Systolic algorithms
Tensor product
Theoretical computing
Lower and upper bounds
Tensor product
Computational complexity
Systolic algorithms
Lower bound
Upper bound
Generating function
Optimal algorithm
Applied mathematics
Online AccessGet full text
ISSN0096-3003
1873-5649
DOI10.1016/j.amc.2004.09.045

Cover

More Information
Summary:In this paper we examine the computational complexity of optimal systolic array algorithms for tensor product. We provide a time minimal schedule that meets the computed processor lower and upper bounds including one for tensor product. Our principle contribution is to find lower and upper bounds in the algorithm and its implementation for generating function and find processor-time-minimal schedule.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2004.09.045