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: BEE.
gollark: It should have a pointer to the 1th element, the eth element, the e²th element, and so on.
gollark: Interesting features:- all numbers are hexadecimal always- it has no support for immediate parameters which aren't addresses or something- there are no registers and exactly 256 bytes of memory, one of which is the program counter- conditional moves are the only conditional thing
gollark: ```x86asm!PAD E0LOOP:re 8 RIadd RJ RI !1mez RJ I !0re 8 RJidm RI RJmov I !LOOPRI: ! 0RJ: ! 0```Here is some example code.
gollark: Or machine code.

See also


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.