Solving dynamic programming problems efficiently on modular linear pipelines
Jean‐Frédéric Myoupo · 1992
The authors present a fully pipelined modular linear systolic algorithm for dynamic programming. They use geometric considerations to design the array. Its characteristics make it fully-pipelined. It runs in 1.5n/sup 2/+O(n) time steps on an array of n/sup 2//6+O(n) processors.>