z-logo
open-access-imgOpen Access
An Efficient Program for Many-Body Simulation
Author(s) -
Andrew W. Appel
Publication year - 1985
Publication title -
siam journal on scientific and statistical computing
Language(s) - English
Resource type - Journals
eISSN - 2168-3417
pISSN - 0196-5204
DOI - 10.1137/0906008
Subject(s) - computation , computer science , range (aeronautics) , tree (set theory) , code (set theory) , field (mathematics) , binary logarithm , algorithm , time complexity , computational science , theoretical computer science , parallel computing , mathematics , discrete mathematics , combinatorics , programming language , pure mathematics , materials science , set (abstract data type) , composite material
The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at the leaves and internal nodes labeled with the centers of mass of their descendants allows several simultaneous attacks on the computation time required by the problem. These approaches range from algorithmic changes (replacing an $O(N^2 )$ algorithm with an algorithm whose time-complexity is believed to be $O(N\log N)$) to data structure modifications, code-tuning, and hardware modifications. The changes reduced the running time of a large problem $(N = 10,000)$ by a factor of four hundred. This paper describes both the particular program and the methodology underlying such speedups.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom