SYNTHESIZING LINEAR SYSTOLIC ARRAYS FOR DYNAMIC PROGRAMMING PROBLEMS
Résumé
In this paper we design modular linear systolic arrays for the solutions of dynamic programming problems using geometric considerations. Our results show that solving a dynamic programming problem of size n requires (n - 1) ⌈( n/α)⌉ + 1 cells and (n - 1) ((α + 3) ⌈(n/α)⌉ + 2) + 1 time steps, where each cell has a local memory of constant size α and the time delay between two consecutive cells of the array is assumed to be constant.