Efficient parallel algorithms
On efficient parallel computations for some dynamic programming problems
Theoretical Computer Science
A sublinear parallel algorithm for some dynamic programming problems
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Parallel Dynamic Programming on Clusters of Workstations
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
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).