1996
DOI: 10.1016/0167-6423(95)00022-4
|View full text |Cite
|
Sign up to set email alerts
|

Massive parallelization of divide-and-conquer algorithms over powerlists

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1996
1996
2018
2018

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Aside from Huang et al (1992), there is other work related to ours. Misra (1994) and Achatz and Schulte (1996) restrict themselves to a binary division of data and problems. The approach of Mou and Hudak (1988) and Mou (1989Mou ( , 1990 allows an arbitrary division of problems and a division of multi-dimensional data into two parts per dimension.…”
Section: Results Related Work and Further Researchmentioning
confidence: 99%
“…Aside from Huang et al (1992), there is other work related to ours. Misra (1994) and Achatz and Schulte (1996) restrict themselves to a binary division of data and problems. The approach of Mou and Hudak (1988) and Mou (1989Mou ( , 1990 allows an arbitrary division of problems and a division of multi-dimensional data into two parts per dimension.…”
Section: Results Related Work and Further Researchmentioning
confidence: 99%
“…Blelloch [4] gives an explicitly data parallel language that can express recursions in divide and conquer algorithms. Misra [19] describes the powerlist, a data structure akin to LISP list, but more suited for parallel algorithms and parallel recursions [1]. List homomorphisms are recursive functions on lists that can describe divide and conquer recursions and also map well to powerlists [11].…”
Section: Related Workmentioning
confidence: 99%
“…We do not deal with the issue of mapping these programs to particular parallel architectures, nor provide suitable cost models to justify the synthesized programs. A number of other works, such as [AS96,PP93], have dealt with the more intricate implementation issue using divide-and-conquer programs as starting points. These works are therefore complimentary to our proposal.…”
Section: An] C) =~F= a +(C X N)mentioning
confidence: 99%