On efficient parallel computations for some dynamic programming problems
Theoretical Computer Science
A bridging model for parallel computation
Communications of the ACM
An introduction to parallel algorithms
An introduction to parallel algorithms
Reducing the symmetric matrix eigenvalue problem to matrix multiplications
SIAM Journal on Scientific Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation
SIAM Journal on Computing
A chained-matrices approach for parallel computation of continued fractions and its applications
Journal of Scientific Computing
Internal loops in RNA secondary structure prediction
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Introduction to algorithms
Communication efficient BSP algorithm for all nearest smaller values problem
Journal of Parallel and Distributed Computing
Fast Parallel Computation of Polynomials Using Few Processes
Proceedings on Mathematical Foundations of Computer Science
Parallel Dynamic Programming on Clusters of Workstations
IEEE Transactions on Parallel and Distributed Systems
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
A parallel dynamic programming algorithm on a multi-core architecture
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
On Efficient Computation of Matrix Chain Products
IEEE Transactions on Computers
Performance results of running parallel applications on the InteGrade
Concurrency and Computation: Practice & Experience - Advanced Scheduling Strategies and Grid Programming Environments
| Hi-index | 0.00 |
The matrix chain order problem (MCOP) is an important example of a dynamic programming problem. It has a simple definition and is frequently used to represent a larger class of dynamic programming problems, called Non-serial Polyadic Problems. This paper presents a coarse-grained parallel solution for the MCOP with O(n3/p3) time and O(1) communication steps in the worst case. The paper will also present the experimental results from an implementation of the algorithm. In our experiments speedups of up to 6.61 with 32 processes were achieved. For our knowledge this is the fastest solution to the problem in distributed memory computing both from theoretical and practical viewpoints.