Dynamic programming on a functional memory computer

In a previous paper [1], we described the solution of dynamic programming problems on a new class of parallel processing systems, the Hawaii Parallel Computer (HPC). The HPC has a novel architecture distinguished by its incorporation of field programmable gate arrays to evaluate expressions and by i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & mathematics with applications (1987) Ročník 37; číslo 11; s. 17 - 22
Hlavní autoři: Lew, A., Halverson, R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.06.1999
Témata:
Decision tables
Dynamic programming
Nondeterministic algorithms
Parallel processing
Reconfigurable combinatorial logic
Nondeterministic algorithms
Parallel processing
Decision tables
Reconfigurable combinatorial logic
Dynamic programming
ISSN:0898-1221, 1873-7668
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In a previous paper [1], we described the solution of dynamic programming problems on a new class of parallel processing systems, the Hawaii Parallel Computer (HPC). The HPC has a novel architecture distinguished by its incorporation of field programmable gate arrays to evaluate expressions and by its use of a decision-table data structure to represent computer programs. As specific examples, we showed how the HPC can be used to implement dynamic programming solutions of shortest-path and traveling-salesman problems. In that earlier implementation, we simply adapted algorithms intended for execution on conventional deterministic von Neumann computers. More recently, we designed a successor to the HPC, a “functional memory” computer, which includes constructs for nondeterministic computation. In this paper, we discuss how dynamic programming algorithms can be adapted to take advantage of this nondeterminism.
ISSN:0898-1221
1873-7668
DOI:10.1016/S0898-1221(99)00138-8