Synthetic Methodologies For An Optimal Time-spaceAlgorithm Complexity Distribution
Michael P. Bekakos · IEEE International Conference on High Performance Computing, Data, and Analytics · 2000
A challenging problem in systolic processing is to develop methodologies for mapping algorithms into systolic architectures. Systolic Arrays (SAs) can be produced not only through a try and error approach but also using optimal synthetic methods. Through the proposed procedure herein which is based on the dependence method processor-time optimal SAs can be synthesized. The resulting systolic designs are optimal in both aspects, the hardware used and the time complexity achieved.