Processor-time-optimal systolic arrays

Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic graph (dag) model of algorithms is used to de ne a time-minimal schedule and a processor-time-minimal schedule. We present a technique for nding a lower bound on the number of processors needed to achieve a given schedule of an algorithm. The application of this technique is illustrated with a tensor product computation. We then apply the technique to the free schedule of algorithms for matrix product, Gaussian elimination, and transitive closure. For each, we provide a timeminimal processor schedule that meets these processor lower bounds, including the one for tensor product.

• Type: Journal
• Year: 2000
• Where: PAAPP
• Authors: Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman
• Keywords: Directed Acyclic Graph, Lower Bounds, PAAPP 2000, Tensor Product