Flattening Trees

• Bibtex

  @InProceedings{tflat,
     author    = "Gabriele Keller and Manuel M. T. Chakravarty",
     title     = "Flattening Trees",
     booktitle = "Proceedings of the 4th International Euro-Par 
                  Conference (EuroPar98)",
     pages     = "709-719",
     publisher = "Springer Verlag",
     series    = "Lecture Notes in Computer Science",
     year      = 1998
  }
  
  

• 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 defined. Thus, important parallel algorithms can be implemented more clearly and efficiently.

• Postscript version