The SPLASH-2 programs: characterization and methodological considerations
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Fast and parallel mapping algorithms for irregular problems
The Journal of Supercomputing
High performance Fortran for highly irregular problems
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
An evaluation of computing paradigms for N-body simulations on distributed memory architectures
Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Data-parallel load balancing stategies
Parallel Computing
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Enhancing locality for recursive traversals of recursive structures
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Automatically enhancing locality for tree traversals with traversal splicing
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 0.00 |
This paper presents a data-parallel formulation for N-body simulations using the Barnes-Hut method. The tree-structured problem is first linearized by using space-filling curves. This process allows us to use standard data distributions and parallel array operations available in data-parallel languages. A new efficient HPF implementation of the Barnes-Hut method is presented in this paper, characterized by the use of array copy sections to express communications, obtaining efficient point-to-point data transferences. In addition, HPF LOCAL constructs are used to obtain very compact and efficient local (node) codes.