ChaNGa
ChaNGa (Charm N-body GrAvity solver) is a computer program to perform collisionless N-body simulations. It can perform cosmological simulations with periodic boundary conditions in comoving coordinates or simulations of isolated stellar systems. It is based on the Barnes–Hut algorithm and uses Ewald summation for periodic forces.
ChaNGa makes use of the Charm++ parallel programming system, including its dynamic load balancing schemes, in order to scale to large processor configurations. Simulation results have been reported on up to 20,000 IBM Bluegene/L processors .
More information
For more information on obtaining, building and running ChaNGa, please see the Wiki documentation at .
gollark: It is the product of the first 100 primes, so it has many, many factors.
gollark: Base 4711930799906184953162487834760260422020574773409675520188634839616415335845034221205289256705544681972439104097777157991804380284218315038719444943990492579030720635990538452312528339864352999310398481791730017201031090 please.
gollark: ACTUALLY, WAIT A MINUTE, I HAVE A BETTER IDEA.
gollark: LET'S USE BASE 60000000000000000000 FOR MORE DIVISIBILITY!
gollark: OKAY THEN
See also
- PKDGRAV
- GADGET
- GRAPE
External links
- University of Washington ChaNGa website
- Charm++ web page at the Parallel Programming Lab, UIUC
- ChaNGa Wiki documentation
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.