Article ID Journal Published Year Pages File Type
9506699 Applied Mathematics and Computation 2005 23 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
,