A sublinear parallel algorithm for some dynamic programming problems

A sublinear parallel algorithm for some dynamic programming problems

0.00 Avg rating0 Votes
Article ID: iaor19941904
Country: Netherlands
Volume: 106
Start Page Number: 361
End Page Number: 371
Publication Date: Feb 1992
Journal: Theoretical Computer Science
Authors: , ,
Keywords: computational analysis: parallel computers
Abstract:

This paper presents a sublinear parallel algorithm for dynamic programming problems such as computing an optimal order of matrix multiplications, an optimal binary search tree or an optimal triangulation of polygons. An algorthm was presented by Rytter which runs in equ1 time using equ2 processors. An algorithm is presented in this paper which runs in equ3 time using equ4 processors on a CREW PRAM. Amongst known sublinear algorithms, this is an improvement by a factor of equ5 in terms of processor-time product.

Reviews

Required fields are marked *. Your email address will not be published.