Optimal Mappin of Systolic Algorithms by RegularTnstruct ion Shifts
Philippe Clauss, Guy-RenC Perrin · 1994
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 non linear allocation technique is presented : the Instruction Shifl. It allows to synthesize planar regular arrays without increasing the initial linear schedule. This technique is illustrated with the LLt Cholesky factorization.