Parallel dynamic programming

Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal triangulation of polygons assume a similar form. A CREW PRAM algorithm has been given to solve such dynamic programming problems. The algorithm us...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 497 - 500
Hlavní autoři: Viswanathan, V., Huang, S.-H.S., Hongfei Liu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
Binary search trees
Binary trees
Computer science
Dynamic programming
Equations
H infinity control
NASA
Open systems
Phase change random access memory
ISBN:0818620870, 9780818620874
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í:Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal triangulation of polygons assume a similar form. A CREW PRAM algorithm has been given to solve such dynamic programming problems. The algorithm uses O(n/sup 6//log n) processors and runs in O(log/sup 2/ n)time. A modified algorithm is presented which reduces the processor requirement to O(n/sup 6//log/sup 5/n) while maintaining the same time complexity of O(log/sup 2/ n).< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143590