1993
DOI: 10.1016/0167-8191(93)90102-q
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming on a shared-memory multiprocessor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

1994
1994
2011
2011

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 1 publication
0
9
0
Order By: Relevance
“…have been approached for systolic arrays [12,13], general shared-memory multiprocessors [14] and for PRAM models [15,16]. All these contributions were proposed for specific problems and specific architectures.…”
Section: Introductionmentioning
confidence: 99%
“…have been approached for systolic arrays [12,13], general shared-memory multiprocessors [14] and for PRAM models [15,16]. All these contributions were proposed for specific problems and specific architectures.…”
Section: Introductionmentioning
confidence: 99%
“…Bradford [7] described several algorithms, which solve optimal matrix chain multiplication parenthesizations using the CREW PRAM model. Edmonds et al [14] and Galil et al [16] presented several parallel algorithms on general shared memory multiprocessor systems. Another important research area is in the systolic framework, for example, Guibas et al [19] [23] focuses on designing triangular systolic arrays.…”
Section: Related Workmentioning
confidence: 99%
“…They do not consider data allocation. Edmonds et al [19] proposed a dynamic programming method on a shared memory multiprocessor. They attempt to balance work load, while keeping synchronization cost low.…”
Section: Background and Related Workmentioning
confidence: 99%