Optimal mapping of systolic algorithms by regular instruction shifts
Philippe Clauss, Guy-RenC Perrin · 2002
This paper addresses the problem of determining efficient mappings of systems of affine recurrence equations into regular arrays, in a nearly space-optimal fashion. A new nonlinear allocation technique is presented: the Instruction Shift. It allows to synthesize planar regular arrays without increasing the initial linear schedule. This technique is illustrated with the LL/sup t/ Cholesky factorization.>