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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 497 - 500
Main Authors: Viswanathan, V., Huang, S.-H.S., Hongfei Liu
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
Binary search trees
Binary trees
Computer science
Dynamic programming
Equations
H infinity control
NASA
Open systems
Phase change random access memory
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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).< >
AbstractList 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).< >
Author Viswanathan, V.
Hongfei Liu
Huang, S.-H.S.
Author_xml – sequence: 1
  givenname: V.
  surname: Viswanathan
  fullname: Viswanathan, V.
  organization: Dept. of Comput. Sci., Houston Univ., TX, USA
– sequence: 2
  givenname: S.-H.S.
  surname: Huang
  fullname: Huang, S.-H.S.
  organization: Dept. of Comput. Sci., Houston Univ., TX, USA
– sequence: 3
  surname: Hongfei Liu
  fullname: Hongfei Liu
  organization: Dept. of Comput. Sci., Houston Univ., TX, USA
BookMark eNotjk1rAjEURQNtwWrdS-nCPzD63iQx7y2Lra0gOKB7yeRDUmZGyXTjv--AvZvDPYvLHYvH7tIFIWYIC0Tg5aH6qBbIPFQlNcODGAMhrUogAyMx7fsfGKL1oNSzeKtstk0Tmrm_dbZNbn7Nl3O2bZu684t4irbpw_SfE3HcfB7X38Vu_7Vdv--KRPxbKK9AeatWJUGMDrQbUGp0GEwtybAnJ4PxQB5A1WxYISBDpNpKV0Y5Ea_32RRCOF1zam2-ne735R_e0Tte
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143590
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 500
ExternalDocumentID 143590
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-4d404da46280ffc05c0ff251c1e7b3879d8c3e7d08d004b979410190f8ba3c2f3
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:07 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-4d404da46280ffc05c0ff251c1e7b3879d8c3e7d08d004b979410190f8ba3c2f3
PageCount 4
ParticipantIDs ieee_primary_143590
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.215464
Snippet Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal...
SourceID ieee
SourceType Publisher
StartPage 497
SubjectTerms Binary search trees
Binary trees
Computer science
Dynamic programming
Equations
H infinity control
NASA
Open systems
Phase change random access memory
Title Parallel dynamic programming
URI https://ieeexplore.ieee.org/document/143590
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4o8eAJRYwPNHvwWunSbh9nlXgim8iBG9l2ZhMSBYPg76ftLhgTL576Sps-M51pv_kAHpzMq1pUBVNokEkrHbOGPMNKKFkLJzDHRDahJxMzm9my9bOdsDBElD6f0WOMprd8XPltNJUNo2y3QT8_1lo1UK2DOYUXRYQ6JA-PeYjxsA9b_zr7tNy_UnI7fCufywjUC8nU5i9ulSRaxt1_deoM-j8Qvaw8CJ9zOKJlD7p7joasPbIXMCirdaRLec-w4Z7P2h9ZH6FaH6bjl-nTK2sZEdjC2A2TKLnEKsJJeV17XvgQhAuKz0k7YbRF4wVp5AbD3nc2nLU8YsVr4yrhR7W4hM5ytaQryJR2I5KKk1MkQ6ktCo9Bt1GRsk-guYZeHOr8s_F5MW9GefNn7i2cxqlsDBMD6GzWW7qDE_-9WXyt79M67QCnPo62
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB6kCnqq1oqPqnvwGpttkt3krJaKdVlwD72VTSYLBW1Lbf39JtltRfDiKS8S8mQyk3zzAdxpHpcVKwVJUCLhimuipDUES5bwimmGMQayiTTL5GSi8sbPdsDCWGvD5zN776PhLR8XZuNNZX0v25XTz_cF5wNag7V2BhUqhAc7BB-PsYtRtxMbDzvbNN--U1LVf8sfcw_Vc8nQ6i92lSBchu1_desYuj8gvSjfiZ8T2LPzDrS3LA1Rc2hPoZeXK0-Y8h5hzT4fNX-yPly1LhTDp-JhRBpOBDKTak04csqx9IBSWlWGCuMCd0UxsU01k6lCaZhNkUp0u18rd9pijxavpC6ZGVTsDFrzxdyeQ5SkemB5Qq1OLHelSgiDTrtJPGkfQ3kBHT_U6bL2ejGtR3n5Z-4tHI6K1_F0_Jy9XMGRn9baTNGD1nq1sddwYL7Ws8_VTVizb0zSkf0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=Parallel+dynamic+programming&rft.au=Viswanathan%2C+V.&rft.au=Huang%2C+S.-H.S.&rft.au=Hongfei+Liu&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=497&rft.epage=500&rft_id=info:doi/10.1109%2FSPDP.1990.143590&rft.externalDocID=143590
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true