Processor-time-optimal systolic arrays

Minimizing the amount of time and number of processors needed to perform an applicationreduces the application's fabrication cost and operation costs. A directed acyclic graph (dag)model of algorithms is used to define a time-minimal schedule and a processor-time-minimalschedule. We present a technique for finding a lower bound on the number of processors neededto achieve a given schedule of an algorithm. The application of this technique is illustrated witha tensor product computation. We ...