The Library
On efficient parallel computations for some dynamic programming problems
Tools
Rytter, Wojciech (1987) On efficient parallel computations for some dynamic programming problems. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

PDF (Department of Computer Science Research Report)
WRAP_csrr104.pdf  Other  Requires a PDF viewer. Download (961Kb)  Preview 
Abstract
A general method for parallelism of some dynamic programming algorithms on VLSI was presented in [6]. We present, a general method for parallelisation for the same class of problems on more powerful parallel computers. The method is demonstrated on three typical dynamic programming problems: computing the optimal order of matrix multiplications, the optimal binary search tree and optimal triangulation of polygons (see[1,2]). For these problems the dynamic programming approach gives algorithms having a similar structure. They can be viewed as straight line programs of size O(n3). the general method of parallelisation of such programs described by Valiant et al [16] then leads directly to algorithms working in log2 time with O(n9) processors. However we adopt an alternative approach and show that a special feature of dynamic programming problems can be used. They can be thought as generalized parsing problems: find a tree of the optimal decomposition of the problem into smaller subproblems. A parallel pebble game on fees [10,11] is used to decrease the number of processors and to simplify the structure of the algorithms. We show that the dynamic programming problems considered can be computed in log2n time using n6/log(n) processors on a parallel random access machine without write conflicts (CREW PRAM). The main operation is essentially matrix multiplication, which is easily implementable on parallel computers with a fixed interconnection network of processors (ultracomputers, in the sense of [15]). Hence the problems considered also can be computed in log2n time using n6 processors on a perfect shuffle computer (PSC) or a cube connected computer (CCC). An extension of the algorithm from [14] for the recognition of contextfree languages on PSC and CCC can be used. If the parallel random access machine with concurrent writes (CRCW PRAM is used then the minimum of m numbers can be determined in constant time (see [8]) and consequently the parallel time for the computation of dynamic programming problems can be reduced from log2(n) to log(n). We investigate also the parallel computation of Fees realising the optimal cost of dynamic programming problems.
Item Type:  Report  

Subjects:  Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software  
Divisions:  Faculty of Science > Computer Science  
Library of Congress Subject Headings (LCSH):  Parallel processing (Electronic computers), Dynamic programming  
Series Name:  Department of Computer Science research report  
Publisher:  University of Warwick. Department of Computer Science  
Official Date:  June 1987  
Dates: 


Number:  Number 104  
Number of Pages:  11  
DOI:  CSRR104  
Institution:  University of Warwick  
Theses Department:  Department of Computer Science  
Status:  Not Peer Reviewed  
Publication Status:  Unpublished  
Related URLs: 
Request changes or add full text files to a record
Repository staff actions (login required)
View Item 
Downloads
Downloads per month over past year