Tineoreticai Computer Science 76 (i990) 33i-34i North-holland

Abstract

This paper provides a un,fying mathematical proof which replaces a mechanical certification of the optimal paraiieiization of sorting networks on a case by case basis. Paraiielization of sequentiai program traces by means of a semantic-preserving transformation is alscussed in the literature in the context of a method for synthesis of systolic architecture. The issue of optimal paraiieiization is important in systolic design. The mathematical proof provides a better insight into the fundamental aspects of the transformation.

1 Figure or Table

Cite this paper

@inproceedings{Gannett2001TineoreticaiCS, title={Tineoreticai Computer Science 76 (i990) 33i-34i North-holland}, author={Ethan Gannett and Suraj C. KQTMARII and H.-C. Yen}, year={2001} }