Paper Info
Title
Flattening Trees
Abstract
Nested data-parallelism can be efficiently implemented by mapping it to flat parallelism using Blelloch & Sabot's flattening transformation. So far, the only dynamic data structure supported by flattening are vectors. We extend it with support for user-defined recursive types, which allow parallel tree structures to be denfied. Thus, important parallel algorithms can be implemented more clearly and efficiently.
Year
DOI
Venue
1998
10.1007/BFb0057920
Euro-Par
Keywords
DocType
ISBN
Flattening Trees
Conference
3-540-64952-2
Citations 
PageRank 
References 
10
0.65
3
Authors
2
Name
Order
Citations
PageRank
Gabriele Keller165736.02
Manuel M. T. Chakravarty266641.89