NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Parallel solution of sparse one-dimensional dynamic programming problemsParallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.
Document ID
19890012171
Acquisition Source
Legacy CDMS
Document Type
Preprint (Draft being sent to journal)
Authors
Nicol, David M. (College of William and Mary Williamsburg, VA., United States)
Date Acquired
September 5, 2013
Publication Date
March 1, 1989
Subject Category
Computer Programming And Software
Report/Patent Number
ICASE-89-17
NAS 1.26:181812
NASA-CR-181812
Accession Number
89N21542
Funding Number(s)
CONTRACT_GRANT: NAS1-18605
PROJECT: RTOP 505-90-21-01
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available