Title :
Parallel dynamic programming
Author :
Huang, Shou-Hsuan Stephen ; Liu, Hongfei ; Viswanathan, Venkatraman
Author_Institution :
Dept. of Comput. Sci., Houston Univ., TX, USA
fDate :
3/1/1994 12:00:00 AM
Abstract :
Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, 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(n6/log n) processors and runs in O(log2 n) time. In this article, a modified algorithm is presented that reduces the processor requirement to O(n6/log 5n) while maintaining the same time complexity of O(log2 n)
Keywords :
computational complexity; dynamic programming; parallel algorithms; CREW PRAM algorithm; matrix multiplication; optimal binary search tree; optimal triangulation of polygons; parallel dynamic programming; time complexity; Binary search trees; Computer architecture; Concurrent computing; Conferences; Dynamic programming; Histograms; Labeling; Parallel processing; Phase change random access memory; Very large scale integration;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
