A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A parallel hashed Oct-Tree N-body algorithm
1993
Proceedings of the 1993 ACM/IEEE conference on Supercomputing - Supercomputing '93
Preserved Fulltext
Instead of using pointers to indicate the topology of the tree, we identify each possible cell with a key. The mapping of keys into memory locations is achieved via a hash table. ...
We report on an efficient adaptive N-body method which we have recently designed and implemented. ...
This research was supported in part by a grant from NASA under the HPCC program. ...
doi:10.1145/169627.169640
dblp:conf/sc/WarrenS93
fatcat:fywujwtphzdb7djjl47la5jgmq
Page 3610 of Mathematical Reviews Vol. , Issue 2000e
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Results are given for the height of a random hash tree and a random pebbled hash tree. In a hash tree, one starts with n i.i.d. uniform (0,1) random variables. ...
2000e:68044
©(n log’ nlog L) compared with @(n log L) for an oct-tree. (L is the separation ratio of the set of points.) ...
A portable parallel particle program
1995
Computer Physics Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We describe our implementation of the parallel hashed oct-tree (HOT) code, and in particular its application to neighbor finding in a smoothed particle hydrodynamics (SPH) code. ...
Performance of the program on a variety of problems (including gravity, SPH, vortex method and panel method) is measured on several parallel and sequential machines. ...
This research was supported in part by a grant from NASA under the HPCC program. ...
doi:10.1016/0010-4655(94)00177-4
fatcat:c4z7vfd4obalnnm5vgmogeiaum
M-Tree: A parallel abstract data type for block-irregular adaptive applications
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes an abstract data type called M-Tree ...
We would also like to extend our thanks to the Imperial/Fujitsu Parallel Computing Research Centre for their continued support. ...
We have studied a number of applications of the M-Tree and present here two examples of its use: a simple heat conduction problem, and an implementation of the Barnes-Hut N -body particle simulation algorithm ...
doi:10.1007/bfb0002795
fatcat:cy7ufn6cgbf53ec6a5ddbxxq2q
Fast Parallel Tree Codes for Gravitational and Fluid Dynamical N-Body Problems
1994
The International Journal of Supercomputer Applications and High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, the code for parallel tree construction and traversal is shared. ...
In the simulation of incompressible flows, the flow may be modeled by the dynamics of a set of N interacting vortices. ...
MSW and JS were supported in part by a grant from NASA under the HPCC program. ...
doi:10.1177/109434209400800205
fatcat:knhrwcrqfndrvm6pyofdqugwkq
Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical N-Body algorithms like FMM. ...
Secondly, we optimize the granularity of communication to find the optimal balance between a bulk-synchronous collective communication of the local essential tree and an RDMA per task per cell. ...
Hashed Oct-Tree (HOT) In HOT, initially proposed by [20] , domain is partitioned by splitting Morton/Hilbert ordered space filling curves into equal segments as shown in figures 1(a) and 1(b). ...
arXiv:1702.05459v1
fatcat:h3qbc2kem5cgzpdbpuctvr74mq
Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical N -Body algorithms like FMM. ...
Secondly, we optimize the granularity of communication to find the optimal balance between a bulk-synchronous collective communication of the local essential tree and an RDMA per task per cell. ...
Hashed Oct-Tree (HOT) In HOT, initially proposed by [20] , domain is partitioned by splitting Morton/Hilbert ordered space filling curves into equal segments as shown in figures 1(a) and 1(b). ...
doi:10.1007/978-3-319-58667-0_5
fatcat:okty6d3fbrel3pqivkgnwpctam
Gordon Bell finalists II---$158/GFLOPS astrophysical N-body simulation with reconfigurable add-in card and hierarchical tree algorithm
2006
Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
As an entry for the 2006 Gordon Bell price/performance prize, we report an astrophysical N-body simulation performed with reconfigurable computing systems and a hierarchical tree algorithm. ...
On our system, we performed a cosmological N-body simulation with 2.1 million particles, which sustained a performance of 15.39 Gflops averaged over 4.33 hours. ...
The treecode we used is parallelized by essentially the same scheme as Hashed Oct-Tree algorithm [32] (with Peano-Hilbert ordering). The run took 1,279 timesteps and 21,379 seconds (5.94 hours). ...
doi:10.1145/1188455.1188505
dblp:conf/sc/KawaiF06
fatcat:n4oue7mi2zc5lkr4cylsvhyb4q
Page 1316 of Mathematical Reviews Vol. , Issue 2002B
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
in
N-body simulations on a CREW PRAM. ...
Sci. 197 (1998), no. 1-2, 157-169; MR 99a:70002], we presented a linear time algorithm which builds the oct tree bottom- up and showed that Appel’s algorithm can be implemented in O(7) sequential time. ...
Scalable parallel formulations of the barnes-hut method for n-body simulations
1994
Supercomputing, Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coupled with parallel processing, these techniques hold the promise of large scale n-body simulations. ...
The problem of simulating the motion of a set of bodies arises in a variety of domains such as astrophysics, molecular dynamics, fluid dynamics, and high energy physics. ...
Applications and fast algorithms for n-body methods A variety of physical simulations are based on n-body methods. ...
doi:10.1145/602843.602846
fatcat:qguwievrqnfo3dqxxbck7leury
Data structure for association rule mining: T-trees and P-trees
2004
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two new structures for Association Rule Mining (ARM), the T-tree, and the P-tree, together with associated algorithms, are described. ...
The authors demonstrate that the structures and algorithms offer significant advantages in terms of storage and execution time. ...
The Apriori T-tree generation algorithm is presented in Fig. 2 , where start is a reference to the start of the top-level array, < is the input data set, N the number of attributes (columns), D the number ...
doi:10.1109/tkde.2004.8
fatcat:fdjdn2oev5d75gcjl4vddi6bbm
Scalable parallel formulations of the Barnes–Hut method for n-body simulations
1998
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coupled with parallel processing, these techniques hold the promise of large scale n-body simulations. ...
The problem of simulating the motion of a set of bodies arises in a variety of domains such as astrophysics, molecular dynamics, fluid dynamics, and high energy physics. ...
Applications and fast algorithms for n-body methods A variety of physical simulations are based on n-body methods. ...
doi:10.1016/s0167-8191(98)00011-8
fatcat:bfio244qyrcwhknbpmfbtkfhly
Scalable parallel formulations of the barnes-hut method for n-body simulations
1994
Supercomputing, Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coupled with parallel processing, these techniques hold the promise of large scale n-body simulations. ...
The problem of simulating the motion of a set of bodies arises in a variety of domains such as astrophysics, molecular dynamics, fluid dynamics, and high energy physics. ...
Applications and fast algorithms for n-body methods A variety of physical simulations are based on n-body methods. ...
doi:10.1145/602770.602846
fatcat:ts43gvklhvhotalk7cnfxyvc2m
Design of a Multithreaded Barnes-Hut Algorithm for Multicore Clusters
2015
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A parallel hashed oct-tree n-body
algorithm. ...
Parallel hierarchical N-body methods. ...
doi:10.1109/tpds.2014.2331243
fatcat:kd2uk2zay5f4xgmikytg7do4pa
A parallel tree code
1996
New Astronomy
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
1996 pre-print arXiv:astro-ph/9603097v1 fatcat:amvgh2scobe5jplyfhedntqm7e
We describe a new implementation of a parallel N-body tree code. ...
The code is load-balanced using the method of orthogonal recursive bisection to subdivide the N-body system into independent rectangular volumes each of which is mapped to a processor on a parallel computer ...
Warren & Salmon (1993) have also recently designed a new algorithm which uses a load-balancing scheme based on a parallel hashed oct-tree (also . ...
doi:10.1016/s1384-1076(96)00009-7
fatcat:74gjiw4ojjglll5idlbylivyca
« Previous
Showing results 1 — 15 out of 381 results