by Konstantinidis, Simos and Kokkotas, Kostas D.
24 pages, 28 figures

We present a new C++ code for collisional N-body simulations of star clusters. The code uses the Hermite fourth-order scheme with block time steps, for advancing the particles in time, while the forces and neighboring particles are computed using the GRAPE-6 board. Special treatment is used for close encounters, binary and multiple sub-systems that either form dynamically or exist in the initial configuration. The structure of the code is modular and allows the appropriate treatment of more physical phenomena, such as stellar and binary evolution, stellar collisions and evolution of close black-hole binaries. Moreover, it can be easily modified so that the part of the code that uses GRAPE-6, could be replaced by another module that uses other accelerating-hardware like the Graphics Processing Units (GPUs). Appropriate choice of the free parameters give a good accuracy and speed for simulations of star clusters up to and beyond core collapse. Simulations of Plummer models consisting of equal-mass stars reached core collapse at t~17 half-mass relaxation times, which compares very well with existing results, while the cumulative relative error in the energy remained below 0.001. Also, comparisons with published results of other codes for the time of core collapse for different initial conditions, show excellent agreement. Simulations of King models with an initial mass-function, similar to those found in the literature, reached core collapse at t~0.17, which is slightly smaller than the expected result from previous works. Finally, the code accuracy becomes comparable and even better than the accuracy of existing codes, when a number of close binary systems is dynamically created in a simulation. This is due to the high accuracy of the method that is used for close binary and multiple sub-systems.

by Galley, Chad R. and Herrmann, Frank and Silberholz, John and Tiglio, Manuel and Guerberoff, Gustavo

We perform a statistical analysis of the binary black hole problem in the post-Newtonian approximation by systematically sampling and evolving the parameter space of initial configurations for quasi-circular inspirals. Through a principal component analysis of spin and orbital angular momentum variables we systematically look for uncorrelated quantities and find three of them which are highly conserved in a statistical sense, both as functions of time and with respect to variations in initial spin orientations. We also look for and find the variables that account for the largest variations in the problem. We present binary black hole simulations of the full Einstein equations analyzing to what extent these results might carry over to the full theory in the inspiral and merger regimes. Among other applications these results should be useful both in semi-analytical and numerical building of templates of gravitational waves for gravitational wave detectors.

by Zwart, Simon Portegies and McMillan, Steve and Gieles, Mark
Only 88 pages. To be published in ARAA. Final version to be submitted on Friday 12 February

Young massive clusters are dense aggregates of young stars that form the fundamental building blocks of galaxies. Several examples exist in the Milky Way Galaxy and the Local Group, but they are particularly abundant in starburst and interacting galaxies. The few young massive clusters that are close enough to resolve are of prime interest for studying the stellar mass function and the ecological interplay between stellar evolution and stellar dynamics. The distant unresolved clusters may be effectively used to study the star-cluster mass function, and they provide excellent constraints on the formation mechanisms of young cluster populations. Young massive clusters are expected to be the nurseries for many unusual objects, including a wide range of exotic stars and binaries. So far only a few such objects have been found in young massive clusters, although their older cousins, the globular clusters, are unusually rich in stellar exotica. In this review we focus on star clusters younger than $latex \sim100$ Myr, more than a few current crossing times old, and more massive than $latex \sim10^4$ \Msun, irrespective of cluster size or environment. We describe the global properties of the currently known young massive star clusters in the Local Group and beyond, and discuss the state of the art in observations and dynamical modeling of these systems. In order to make this review readable by observers, theorists, and computational astrophysicists, we also review the cross-disciplinary terminology.

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.

by Khanna, Gaurav and McKennon, Justin
8 pages, 4 figures, Accepted for publication in Parallel and Distributed Computing and Systems (PDCS 2009)

In this paper, we accelerate a gravitational physics numerical modelling application using hardware accelerators — Cell processor and Tesla CUDA GPU. We describe these new technologies and our approach in detail, and then present our final performance results. We obtain well over an order-of-magnitude performance gain in our application by making use of these many-core architectures.

by Capuzzo-Dolcetta, R.
Invited talk to the 2009 general Conference of the Societa’ Astronomica Italiana. 6 pages including 1 figure

In this paper I will outline some of the aspects and problems of modern celestial mechanics and stellar dynamics, in the context of the quickly growing computing facilities. I will point the attention on the great advantages in using, for astrophysical simulations, the modern, fast and cheap Graphic Processing Units (GPUs) acting as true supercomputers. Finally, I present and discuss some characteristics and performances of a new double-parallel code exploiting the joint power of multicore CPUs and GPUs.

by Nakasato, N.
Poster paper to be appeared in SC09

The kd-tree is a fundamental tool in computer science. Among others, an application of the kd-tree search (oct-tree method) to fast evaluation of particle interactions and neighbor search is highly important since computational complexity of these problems are reduced from O(N^2) with a brute force method to O(N log N) with the tree method where N is a number of particles. In this paper, we present a parallel implementation of the tree method running on a graphic processor unit (GPU). We successfully run a simulation of structure formation in the universe very efficiently. On our system, which costs roughly $900, the run with N ~ 2.87×10^6 particles took 5.79 hours and executed 1.2×10^13 force evaluations in total. We obtained the sustained computing speed of 21.8 Gflops and the cost per Gflops of 41.6/Gflops that is two and half times better than the previous record in 2006.