On The PVM/MPI Computations of Dynamic Programming Recurrences

The generic dynamic programming problem is given by a set of (dynamic programming) recurrence equations. It is an important problem with several applications, such as chain matrix multiplication, optimal binary search trees and polygon triangulation, see [9], [2]. The problem we address in this paper is given by dynamic programming recurrences