Flattening trees-Reference-Cited by-同舟云学术

Flattening trees

Published:1998 Issue: Volume: Page:709-719
ISSN:0302-9743
Container-title:Euro-Par’98 Parallel Processing
language:
Short-container-title:

Author:

Keller Gabriele,Chakravarty Manuel M. T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0057920

Reference12 articles.

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.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Million.js: A Fast Compiler-Augmented Virtual DOM for the Web;Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing;2023-03-27

2. M-PolKA: Multipath Polynomial Key-Based Source Routing for Reliable Communications;IEEE Transactions on Network and Service Management;2022-09

3. Efficient tree-traversals: reconciling parallelism and dense data representations;Proceedings of the ACM on Programming Languages;2021-08-22

4. Automatically deriving cost models for structured parallel processes using hylomorphisms;Future Generation Computer Systems;2018-02

5. EFFICIENT PARALLEL TREE REDUCTIONS ON DISTRIBUTED MEMORY ENVIRONMENTS;SCALABLE COMPUT-PRAC;2017