Calculus of space-optimal mappings of systolic algorithms on processor arrays

Abstract

We present a method to find mappings of systolic algorithms that use the minimal number of processors. This method is based on geometrical interpretations on the convex polyhedra in Zn. We use our results to derive two space-optimal mappings for the Gaussian elimination algorithm. © 1992 Kluwer Academic Publishers.