The automatic generation of parallel code from high level sequential description is of key importance to the widespread use of high performance machine architectures. This text considers (in detail) the theory and practical realization of automatic mapping of algorithms generated from systems of uniform recurrence equations (do-loops) onto fixed size architectures with defined communication primitives. Experimental results of the mapping scheme and its implementation are given.

This text brings together current research directions in the mapping of dynamic programming problems classified as knapsack type recurrence equations which include: the unbounded knapsack problem; 0/1 knapsack problem; subset sum problem; and change making problem.