Issue No. 03 - March (1994 vol. 5)

ISSN: 1045-9219

pp: 326-328

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.277784

ABSTRACT

<p>Recurrence formulations for various problems, such as finding an optimal order of matrixmultiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming problems. The algorithm uses O(n/sup 6//log n) processors and runs in O(log/sup 2/ n) time. In this article, a modified algorithm is presented that reduces the processor requirement to O(n/sup 6//log /sup 5/n) whilemaintaining the same time complexity of O(log/sup 2/ n).</p>

INDEX TERMS

Index Termsdynamic programming; computational complexity; parallel algorithms; parallel dynamicprogramming; matrix multiplication; optimal binary search tree; optimal triangulation ofpolygons; CREW PRAM algorithm; time complexity

CITATION

S.H.S. Huang, V. Viswanathan, H. Liu, "Parallel Dynamic Programming",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 5, no. , pp. 326-328, March 1994, doi:10.1109/71.277784