by Giersz, Mirek and Heggie, Douglas C. and Hurley, Jarrod and Hypki, Arkadiusz
15 pages, 24 figures

We describe a major upgrade of a Monte Carlo code which has previously been used for many studies of dense star clusters. We outline the steps needed in order to calibrate the results of the new Monte Carlo code against N-body simulations for large $latex N$ systems, up to N=200000. The new version of the Monte Carlo code (called MOCCA), in addition to the old version, incorporates direct FewBody integrator for three- and four-body interactions, and new treatment of the escape process based on Fokushige and Heggie (2000). Now stars which fulfil the escape criterion are not removed immediately, but can stay in the system for a certain time which depends on the excess of the energy of a star above the critical energy. They are called potential escapers. FewBody integrator allows to follow all interaction channels, which are important for the rate of creation of various types of objects observed in star clusters, and assures that the energy generation by binaries is treated in a meaner similar to the N-body model.

There are at most three parameters which have to be adjusted against N-body simulations for large N. Two (or one, depends on the chosen approach) connected with the escape process and one responsible for determination of the interaction probabilities. The adopted free parameters are independent on N. They allow MOCCA code to reproduce N-body results, in a reasonably precision, not only for the rate of cluster evolution and the cluster mass distribution, but also for the detailed distributions of mass and binding energy of binaries.

The MOCCA code is at present the most advanced code for simulations of real star clusters. It can follow the cluster evolution in details comparable to N-body code, but orders of magnitude faster.

by Garcia-Senz, Domingo and Cabezon, Ruben M. and Escartin, Jose Antonio
15 pages, 12 figures, accepted for publication in Astronomy & Astrophysics

In this paper we develop and check a fully conservative SPH scheme based on a tensor formulation which can be applied to simulate astrophysical systems. In the proposed scheme derivatives are calculated from an integral expression which leads to a tensor, rather than vectorial, estimation of gradients and reduces to the standard formulation in the continuum limit. The new formulation improves the interpolation of physical magnitudes, leading to a set of conservative equations which looks similar to those of standard SPH. The resulting scheme was checked using a variety of well known tests, all of them simulated in two dimensions. An application of the proposed tensor method to astrophysics was also discussed by simulating the stability of a sun-like polytrope calculated in three dimensions.

by Rein, Hanno and Liu, Shang-Fei
10 pages, 9 figures, re-submitted to A&A, source code available at https://github.com/hannorein/rebound

REBOUND is a new multi-purpose N-body code which is freely available under an open-source license. It was designed for collisional dynamics such as planetary rings but can also solve the classical N-body problem. It is highly modular and can be customized easily to work on a wide variety of different problems in astrophysics and beyond.

REBOUND comes with three symplectic integrators: leap-frog, the symplectic epicycle integrator (SEI) and a Wisdom-Holman mapping (WH). It supports open, periodic and shearing-sheet boundary conditions. REBOUND can use a Barnes-Hut tree to calculate both self-gravity and collisions. These modules are fully parallelized with MPI as well as OpenMP. The former makes use of a static domain decomposition and a distributed essential tree. Two new collision detection modules based on a plane-sweep algorithm are also implemented. The performance of the plane-sweep algorithm is superior to a tree code for simulations in which one dimension is much longer than the other two and in simulations which are quasi-two dimensional with less than one million particles.

In this work, we discuss the different algorithms implemented in REBOUND, the philosophy behind the code’s structure as well as implementation specific details of the different modules. We present results of accuracy and scaling tests which show that the code can run efficiently on both desktop machines and large computing clusters.

by Khanna, Gaurav and McKennon, Justin
14 pages, 4 figures

In this work, we make use of the OpenCL framework to accelerate an EMRI modeling application using the hardware accelerators — Cell BE and Tesla CUDA GPU. We describe these compute technologies and our parallelization approach in detail, present our performance results, and then compare them with those from our previous implementations based on the native CUDA and Cell SDKs. The OpenCL framework allows us to execute identical source-code on both architectures and yet obtain strong performance gains that are comparable to what can be derived from the native SDKs.