K. Olson and J. Dorband, "An Implementation of a Tree Code on a SIMD Parallel Computer," Astrophysical Journal Supplement Series, September 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Performance Evaluation of the Convex SPP-1000.. - Sterling.. Self-citation (Olson) (Correct)
....a resolution limit to the problem. This equation also shows that the problem scales as N 2 and modeling systems with particle numbers larger than several thousand is infeasible. 18 5.3. 1 Tree Code Definition Tree codes are a collection of algorithms which approximate the solution to equation 6 [2, 14, 21]. In these algorithms the particles are sorted into a spatial hierarchy which forms a tree data structure. Each node in the tree then represents a grouping of particles and data which represents average quantities of these particles (e.g. total mass, center of mass, and high order moments of the ....
....of computational interest due to its unstructured and dynamic nature. 5.3. 2 Performance Results for Tree Code We have ported a FORTRAN 90 version of a tree code to the Convex SPP which was initially developed for the Maspar MP 2 and implemented using the algorithm described in Olson and Dorband [21]. The changes to the original code were straightforward and the compiler directives and the shared memory programming model facilitated a very simple minded approach to be taken. The main alterations to the MasPar code were to distribute all the particle calculations evenly among the processors ....
K. Olson and J. Dorband, "An Implementation of a Tree Code on a SIMD Parallel Computer," Astrophysical Journal Supplement Series, September 1994.
N-body Gravitational Simulation - Olson, Packer Self-citation (Olson) (Correct)
No context found.
Olson, K. M. and Dorband, J. E. An Implementation of a Tree Code on a SIMD Parallel Computer. Astrophys. J. Suppl. 94 (September, 1994), 117-125.
An Empirical Evaluation of the Convex SPP-1000 Hierarchical.. - Thomas Sterling (1995) (1 citation) Self-citation (Olson) (Correct)
....parameter also serves to define a resolution limit to the problem. This equation also shows that the problem scales as N 2 and modeling systems with particle numbers larger than several thousand is infeasible. Tree codes are a collection of algorithms which approximate the solution to equation 1 [2, 8, 13]. In these algorithms the particles are sorted into a spatial hierarchy which forms a tree data structure. Each node in the tree then represents a grouping of particles and data which represents average quantities of these particles (e.g. total mass, center of mass, and high order moments of the ....
....but is also of computational interest due to its unstructured and dynamic nature. 4. 1 Experimental Results We have ported a FORTRAN 90 version of a tree code to the Convex SPP which was initially developed for the Maspar MP 2 and implemented using the algorithm described in Olson and Dorband [13]. The changes to the original code were straightforward and the compiler directives and the shared memory programming model facilitated a very simple minded approach to be taken. The main alterations to the MasPar code were to distribute all the particle calculations evenly among the processors ....
K. Olson and J. Dorband, "An Implementation of a Tree Code on a SIMD Parallel Computer," Astrophysical Journal Supplement Series, September 1994.
Beowulf: A Parallel Workstation For Scientific.. - Sterling, Becker.. (1995) (151 citations) Self-citation (Dorband) (Correct)
....update each grid point communication costs are relatively small. A tree code for performing gravitational N body simulations has been developed to reduce a classically O(n 2 ) computation to O(n log n) and has been applied to shared memory [9] distributed memory, and SIMD parallel architectures [8]. The code is being used to study the structure of gravitating, star forming, interstellar clouds as well as to model the fragmentation of comet ShoemakerLevy 9 in its close encounter with Jupiter. A range of number of particles were used from 32K to 256K. It is estimated that Beowulf can support ....
K. Olson and J. Dorband, "An Implementation of a Tree Code on a SIMD Parallel Computer," Astrophysical Journal Supplement Series, September 1994.
Communication Overhead for Space Science Applications on.. - Sterling, Savarese (1995) (7 citations) Self-citation (Olson) (Correct)
No context found.
K. Olson and J. Dorband, "An Implementation of a Tree Code on a SIMD Parallel Computer," Astrophysical Journal Supplement Series, September 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC