M. S. Warren
- 1.A.W. Appel, "An efficient program for many-body simulation," SlAM J. Computing, vot. 6, p. 85, 1985.Google Scholar
- 2.K. Esselink, "The order of Appel's algorithm," Infornzation Processing Let., vol. 41, pp. 141-147, 1992. Google ScholarDigital Library
- 3.J. Barnes and P. Hut, "A hierarchical O(Nlog~ forcecalculation algorithm," Nature, vol. 324, p. 446, 1986.Google ScholarCross Ref
- 4.L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations," J. Comp. Phys., vol. 73, pp. 325-348, 1987. Google ScholarDigital Library
- 5.L. Greengard and W. D. Gropp, "A parallel version of the fast muttipole method," Computers Math. Applic, vol. 20, no. 7, pp. 63-7t, 1990.Google ScholarCross Ref
- 6.E Zhao and S. L. Johnsson, "The parallel multipole method on the connection machine," SlAM J. Sci. Stat. Comp., vol. i2, pp. 1420-1437, Nov. 1991. Google ScholarDigital Library
- 7.K. E. Schmidt and M. A. Lee, "Implementing the fast multipole method in three dimensions," J. Stat. Phys., vol. 63, no. 5/6, pp. 1223-1235, 1991.Google ScholarCross Ref
- 8.I.A. Board, J. W. Causey, J. E Leathrum, A. Windemuth, and K. Schulten, "Accelerated molecular dynamics simulation with the parallel fast multipole algorithm," Chem. Phys. Let., vol. 198, p. 89, 1992.Google ScholarCross Ref
- 9.H.-Q. Ding, N. Karasawa, and W. Goddard, "Atomic level simulations of a million particles: The cell multipole method for coulomb and london interactions,"J, of Chemical Physics, vol. 97, pp. 4309-4315, 1992.Google ScholarCross Ref
- 10.J.K. Salmon andM. S. Warren, "Skeletons from the treecode closet," J. Comp. Phys., 1993. (in press) Google ScholarDigital Library
- 11.J. K. Salmon, Parallel Hierarchical N-bo~, Methods. PhD thesis, California Institute of Technology, 1990. Google ScholarDigital Library
- 12.M. S. Warren and J. K. Salmon, "Astrophysical N-body simulations using hierarchical tree data structures," in Supercompltting '92, IEEE Comp. Soc., 1992. Google ScholarDigital Library
- 13.M. S. Warren, P. J. Quinn, J. K. Salmon, and W. H. Zurek, "Dark halos formed via dissipationless collapse: I. Shapes and alignment of angular momentum," Ap. J., vol. 399, pp. 405-425, 1992.Google ScholarCross Ref
- 14.W. H. Zurek, P. J. Quinn, j. K. Salmon, and M. S. Warren, "Large Scale Structure after COBE: Peculiar Velocities and Correlations of Dark Matter Halos in a CDM Universe,"Nature, 1993. (submitted)Google Scholar
- 15.J. P. Singh, J. L. Hennessy, and A. Gupta, "Implications of hierarchical N-body techniques for multiprocessor architectures," Tech. Rep. CSL-TR-92-506, Stanford University, 1992.Google Scholar
- 16.J.P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. L. Hennessy, "Load balancing and data locality in hierarchical N-body methods," Journal of Parallel and Distributed Computing, 1992. Google ScholarDigital Library
- 17.S. Bhatt, M. Chen, C. Y. Lin, and P. Liu, "Abstractions for parallel N-body simulations," Tech. Rep. DCS/TR-895, Yale University, 1992.Google ScholarCross Ref
- 18.H. Samet, Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990. Google ScholarDigital Library
- 19.J. E. Barnes, "An efficient N-body algorithm for a finegrain parallel computer," in The Use of Supercomputers in Stellar Dynamics (P. Hut and S. McMillan, eds.), (New York), pp. 175-180, Springer-Verlag, 1986.Google Scholar
- 20.N. Engheta, W. D. Murphy, V. Rokhlin, and M. S. Vassiliou, "The fast multipole method (FMM) for electromagnetic scattering problems," IEEE Transactions on Antennas and Propagation, vol. 40, no. 6, pp. 634-642, 1992.Google ScholarCross Ref
- 21.J. K. Salmon, M. S. Warren, and G. S. Winckelmans, "Fast parallel tree codes for gravitational and fluid dynamical N- body problems," International Journal of Supercomputing Applications, 1993. (submitted)Google Scholar
Index Terms
- A parallel hashed Oct-Tree N-body algorithm
Recommendations
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. Many PRAM algorithms can be adapted to SMPs with few modifications. Yet there are ...
Parallel R-Tree Search Algorithm on DSVM
DASFAA '99: Proceedings of the Sixth International Conference on Database Systems for Advanced ApplicationsThough parallel database systems have been extensively studied, as far as we know, the parallel algorithms of R-tree propsed so far are limited to one workstation with multiprocessors or multi disks, where parallel sorting algorithm or concurrent I/O is ...
A massively parallel distributed n-body application implemented with HPX
ScalA '16: Proceedings of the 7th Workshop on Latest Advances in Scalable Algorithms for Large-Scale SystemsOne of the major challenges in parallelization is the difficulty of improving application scalability with conventional techniques. HPX provides efficient scalable parallelism by significantly reducing node starvation and effective latencies while ...
Comments