1995/03/10 by Robert C. Ferrell, Ferrell, Robert C., Edmund Bertschinger +1
Computer Science · Physics and Astronomy · #Astrophysics (astro-ph) #Cellular Automata and Lattice Gases (nlin.CG) #Computational Physics and Python Applications #Distributed and Parallel Computing Systems #FOS: Physical sciences #astro-ph #comp-gas #nlin.CG
paper · pdf · doi:10.48550/arxiv.astro-ph/9503042
8 pages of uuencoded compressed postscript, figures included, to be published in Proceedings of the 1995 Society for Computer Simulation Multiconference, April 1995.
arxiv created 1995/03/10 · openalex publication_date 1995/03/10 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a computational algorithm for computing short range forces between particles. The algorithm has two distinguishing features. First, it is optimized for multi-processor computers, and will use as many processors as are available. Second, it is optimized for inhomogeneous, dynamic particle distributions; for any distribution the computational load is distributed evenly to all processors, and the communication time is less than 15% of the total run time. In this talk we present our new algorithm. We developed the program for a grand-challenge problem in cosmology, simulation of the formation of large-scale structure in the universe. This simulation, run on the Thinking Machines Corporation CM-5, uses the particle-particle/particle-mesh (PPPM) \citehockeast algorithm. The particle-particle phase is computed using the algorithm we describe in this paper. We discuss this and other applications.