Flattening trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1470 LNCS, Issue , 1998, Pages 709-719

  Keller, Gabriele ^a   Chakravarty, Manuel M T ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

METADATA; TREES (MATHEMATICS);

DYNAMIC DATA STRUCTURE; NESTED DATA PARALLELISMS; RECURSIVE TYPES; TREE STRUCTURES;

FORESTRY;

EID: 84882716397     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057920     Document Type: Conference Paper

References (12)

1. P. K. T. Au, M. M. T. Chakravarty, J. Darlington, Yike Guo, Stefan Jähnichen, G. Keller, M. Köhler, W. Pfannenstiel, and M. Simons. Enlarging the scope of vector-based computations: Extending Fortran 90 with nested data parallelism. In W. K. Giloi, editor, Proc. of the Intl. Conf. on Advances in Parallel and Distributed Computing. IEEE Computer Society Press, 1997.
2. G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. In 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 1993.
3. J. Barnes and P. Hut. A hierarchical O(n log n) force calculation algorithm. Nature, 324, December 1986.
4. G. E. Blelloch. Vector Models for Data-Parallel Computing. The MIT Press, 1990.
5. G. E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85-97, 1996.
6. G.E. Blelloch and G. W. Sabot. Compiling collection-oriented languages onto massively parallel computers. Journal o/Parallel and Distributed Computing, 8:119-134, 1990.
7. S. Chatterjee. Compiling nested data-parallel programs for shared-memory multiprocessors. ACM Trans. on Prog. Lang. and Systems, 15(3), 1993.
8. Gabriele Keller and Manuel M. T. Chakravarty. Flattening trees-unabridged. Forschungsbreicht 98-6, Technical University of Berlin, 1998. http://cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html.
9. G. Keller. Transformation-based Implementation of Nested Parallelism for Parallel Computers with Distributed Memory. PhD thesis, Technische Universität Berlin, Fachbereich Informatik, 1998. Forthcoming.
10. G. Keller and M. Simons. A calculational approach to flattening nested data parallelism in functional languages. In J. Jaffar, editor, The 1996 Asian Computing Science Conference, LNCS. Springer Verlag, 1996.
11. J. Prins and D. Palmer. Transforming high-level data-parallel programs into vector operations. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 119-128, San Diego, CA., May 19-22, 1993. ACM.
12. D. Palmer, B. Prins, and S. Westfold. Work-efficient nested data-parallelism. In Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Processing (Frontiers 95). IEEE, 1995.