Article

Free access

A parallel hashed Oct-Tree N-body algorithm

Authors:

M. S. Warren,

J. K. SalmonAuthors Info & Claims

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Pages 12 - 21

https://doi.org/10.1145/169627.169640

Published: 01 December 1993 Publication History

PDF eReader

References

[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.

Digital Library

Google Scholar

[3]

J. Barnes and P. Hut, "A hierarchical O(Nlog~ forcecalculation algorithm," Nature, vol. 324, p. 446, 1986.

Crossref

Google Scholar

[4]

L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations," J. Comp. Phys., vol. 73, pp. 325-348, 1987.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[10]

J.K. Salmon andM. S. Warren, "Skeletons from the treecode closet," J. Comp. Phys., 1993. (in press)

Digital Library

Google Scholar

[11]

J. K. Salmon, Parallel Hierarchical N-bo~, Methods. PhD thesis, California Institute of Technology, 1990.

Digital Library

Google Scholar

[12]

M. S. Warren and J. K. Salmon, "Astrophysical N-body simulations using hierarchical tree data structures," in Supercompltting '92, IEEE Comp. Soc., 1992.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[18]

H. Samet, Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990.

Digital Library

Google Scholar

[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.

Crossref

Google Scholar

[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

Cited By

View all

Kamboh SKhanam FNaeem NParveen SKamboh SKamboh S(2024)Parallel Numerical Solution of 2D Electrostatics Poisson Equation on Different Mesh Partitioning SchemesVFAST Transactions on Mathematics10.21015/vtm.v12i1.184712:1(323-335)Online publication date: 30-Jun-2024
https://doi.org/10.21015/vtm.v12i1.1847
Dongarra JKeyes D(2024)The co-evolution of computational physics and high-performance computingNature Reviews Physics10.1038/s42254-024-00750-zOnline publication date: 23-Aug-2024
https://doi.org/10.1038/s42254-024-00750-z
Malhotra DBarnett A(2024)Efficient convergent boundary integral methods for slender bodiesJournal of Computational Physics10.1016/j.jcp.2024.112855503:COnline publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1016/j.jcp.2024.112855
Show More Cited By

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 Applications

Though 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 Systems

One 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

Information & Contributors

Information

Published In

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

December 1993

935 pages

ISBN:0818643404

DOI:10.1145/169627

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '93

Sponsor:

SIGARCH
IEEE-CS

SC '93: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 19, 1993

Oregon, Portland, USA

Acceptance Rates

Supercomputing '93 Paper Acceptance Rate 72 of 300 submissions, 24%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

327
Total Citations
View Citations
2,553
Total Downloads

Downloads (Last 12 months)239
Downloads (Last 6 weeks)29

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kamboh SKhanam FNaeem NParveen SKamboh SKamboh S(2024)Parallel Numerical Solution of 2D Electrostatics Poisson Equation on Different Mesh Partitioning SchemesVFAST Transactions on Mathematics10.21015/vtm.v12i1.184712:1(323-335)Online publication date: 30-Jun-2024
https://doi.org/10.21015/vtm.v12i1.1847
Dongarra JKeyes D(2024)The co-evolution of computational physics and high-performance computingNature Reviews Physics10.1038/s42254-024-00750-zOnline publication date: 23-Aug-2024
https://doi.org/10.1038/s42254-024-00750-z
Malhotra DBarnett A(2024)Efficient convergent boundary integral methods for slender bodiesJournal of Computational Physics10.1016/j.jcp.2024.112855503:COnline publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1016/j.jcp.2024.112855
Thüring TBreyer MPflüger D(2023)Comparing a Naive and a Tree-Based N-Body Algorithm using Different Standard SYCL Implementations on Various HardwareProceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624604(1906-1917)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624604
Keller SCavelan ACabezon RMayer LCiorba FHuebl ASilvano CRobinson T(2023)Cornerstone: Octree Construction Algorithms for Scalable Particle SimulationsProceedings of the Platform for Advanced Scientific Computing Conference10.1145/3592979.3593417(1-10)Online publication date: 26-Jun-2023
https://dl.acm.org/doi/10.1145/3592979.3593417
Ronen TLevy OGolbert A(2023)Vision Transformers with Mixed-Resolution Tokenization2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)10.1109/CVPRW59228.2023.00486(4613-4622)Online publication date: Jun-2023
https://doi.org/10.1109/CVPRW59228.2023.00486
Tokuue TIshiyama T(2023)Optimizing the gravitational tree algorithm for many-core processorsMonthly Notices of the Royal Astronomical Society10.1093/mnras/stad4001528:1(821-832)Online publication date: 29-Dec-2023
https://doi.org/10.1093/mnras/stad4001
Visser P(2023) Collision detection for N -body Kepler systems Astronomy & Astrophysics10.1051/0004-6361/202243754669(A97)Online publication date: 18-Jan-2023
https://doi.org/10.1051/0004-6361/202243754
Bauinger CBruno O(2023)Massively parallelized interpolated factored Green function methodJournal of Computational Physics10.1016/j.jcp.2022.111837475(111837)Online publication date: Feb-2023
https://doi.org/10.1016/j.jcp.2022.111837
Röpke FDe Marco O(2023)Simulations of common-envelope evolution in binary stellar systems: physical models and numerical techniquesLiving Reviews in Computational Astrophysics10.1007/s41115-023-00017-x9:1Online publication date: 4-May-2023
https://doi.org/10.1007/s41115-023-00017-x
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

Parallel R-Tree Search Algorithm on DSVM

A massively parallel distributed n-body application implemented with HPX

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

Parallel R-Tree Search Algorithm on DSVM

A massively parallel distributed n-body application implemented with HPX

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations