Abstract
An examination is made of the dynamic programming technique implemented on a distributed-memory multiprocessor system. The matrix chain product algorithm is investigated as an example problem. A method for parallelizing the dynamic programming technique for solving the matrix chain product problem is presented and load-balancing considerations are examined. The sequential dynamic programming technique is a fine grain algorithm and considered by many researchers to be too fine grain to execute effectively on a hypercube. The parallel algorithm yielded modest speedups for fixed-size problems. Scaled problems promise even better speedups. Results show that respectable performance for the dynamic programming algorithmic technique can be achieved on a hypercube. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
