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… (More)
DOI: 10.1080/01495730008947355


3 Figures and Tables

Cite this paper

@article{Cappello2000ProcessortimeoptimalSA, title={Processor-time-optimal systolic arrays}, author={Peter R. Cappello and {\"O}mer Egecioglu and Chris J. Scheiman}, journal={Parallel Algorithms Appl.}, year={2000}, volume={15}, pages={167-199} }