Abstract
We consider the following problem: minimize the time of optimal parallel computations of a dynamic programming problem given by dynamic programming recurrences. By an optimal algorithm we mean here the algorithm whose total work matches the work of the best known sequential algorithm for a given problem (in this case O( n 3) ). We construct an optimal parallel algorithm which runs in time O(n 2 3 logn) with total work O( n 3). It is presently the fastest optimal algorithm for the general dynamic programming recurrences. A preliminary version (with a weaker result) of this paper was presented as a part of [10].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.