On Optimal Parallelization of Sorting Networks.
Journal
Theor. Comput. Sci.
Journal Volume
76
Journal Issue
2-3
Pages
331-341
Date Issued
1990
Author(s)
Abstract
This paper provides a unifying mathematical proof which replaces a mechanical certification of the optimal parallelization of sorting networks on a case basis. Parallelization of sequential program traces by means of semantic-preserving transformation is discussed in the literature in the context of a method for synthesis of systolic architecture. The issue of optimal parallelization is important in systolic design. The mathematical proof provides a better insight into the fundamental aspects of the transformation. © 1990.
Type
journal article