/pdf/scalable-molecular-dynamics-with-namd-3j7xyc70g4.pdf

Scalable Molecular Dynamics with NAMD

We use high-resolution N-body simulations to study the equilibrium density profiles of dark matter halos in hierarchically clustering universes. We find that all such profiles have the same shape, independent of the halo mass, the initial density fluctuation spectrum, and the values of the cosmological parameters. Spherically averaged equilibrium profiles are well fitted over two decades in radius by a simple formula originally proposed to describe the structure of galaxy clusters in a cold dark matter universe. In any particular cosmology, the two scale parameters of the fit, the halo mass and its characteristic density, are strongly correlated. Low-mass halos are significantly denser than more massive systems, a correlation that reflects the higher collapse redshift of small halos. The characteristic density of an equilibrium halo is proportional to the density of the universe at the time it was assembled. A suitable definition of this assembly time allows the same proportionality constant to be used for all the cosmologies that we have tested. We compare our results with previous work on halo density profiles and show that there is good agreement. We also provide a step-by-step analytic procedure, based on the Press-Schechter formalism, that allows accurate equilibrium profiles to be calculated as a function of mass in any hierarchical model.

https://iopscience.iop.org/article/10.1086/304888/pdf

A Universal Density Profile from Hierarchical Clustering

We discuss the cosmological simulation code GADGET-2, a new massively parallel TreeSPH code, capable of following a collisionless fluid with the N-body method, and an ideal gas by means of smoothed particle hydrodynamics (SPH). Our implementation of SPH manifestly conserves energy and entropy in regions free of dissipation, while allowing for fully adaptive smoothing lengths. Gravitational forces are computed with a hierarchical multipole expansion, which can optionally be applied in the form of a TreePM algorithm, where only short-range forces are computed with the ‘tree’ method while long-range forces are determined with Fourier techniques. Time integration is based on a quasi-symplectic scheme where long-range and short-range forces can be integrated with different time-steps. Individual and adaptive short-range time-steps may also be employed. The domain decomposition used in the parallelization algorithm is based on a space-filling curve, resulting in high flexibility and tree force errors that do not depend on the way the domains are cut. The code is efficient in terms of memory consumption and required communication bandwidth. It has been used to compute the first cosmological N-body simulation with more than 10 10 dark matter particles, reaching a homogeneous spatial dynamic range of 10 5 per dimension in a three-dimensional box. It has also been used to carry out very large cosmological SPH simulations that account for radiative cooling and star formation, reaching total particle numbers of more than 250 million. We present the algorithms used by the code and discuss their accuracy and performance using a number of test problems. GADGET-2 is publicly released to the research community. Ke yw ords: methods: numerical ‐ galaxies: interactions ‐ dark matter.

/pdf/the-cosmological-simulation-code-gadget-2-48ba4eyb8k.pdf

The Cosmological simulation code GADGET-2

The cold dark matter model has become the leading theoretical picture for the formation of structure in the Universe. This model, together with the theory of cosmic inflation, makes a clear prediction for the initial conditions for structure formation and predicts that structures grow hierarchically through gravitational instability. Testing this model requires that the precise measurements delivered by galaxy surveys can be compared to robust and equally precise theoretical calculations. Here we present a simulation of the growth of dark matter structure using 2,1603 particles, following them from redshift z = 127 to the present in a cube-shaped region 2.230 billion lightyears on a side. In postprocessing, we also follow the formation and evolution of the galaxies and quasars. We show that baryon-induced features in the initial conditions of the Universe are reflected in distorted form in the low-redshift galaxy distribution, an effect that can be used to constrain the nature of dark energy with future generations of observational surveys of galaxies.

/pdf/simulations-of-the-formation-evolution-and-clustering-of-1yahvmv5qk.pdf

Simulations of the formation, evolution and clustering of galaxies and quasars

We study dark-matter halo density profiles in a high-resolution N-body simulation of aCDM cosmology. Our statistical sample contains �5000 haloes in the range 10 11 10 14 h −1 M⊙ and the resolution allows a study of subhaloes inside host haloes. The profiles are parameterized by an NFW form with two parameters, an inner radius rs and a virial radius Rvir, and we define the halo concentration cvirRvir/rs. We find that, for a given halo mass, the redshift dependence of the median concentration is cvir / (1 + z) −1 . This corresponds to rs(z) � constant, and is contrary to earlier suspicions that cvir does not vary much with redshift. The implications are that high- redshift galaxies are predicted to be more extended and dimmer than expected before. Second, we find that the scatter in halo profiles is large, with a 1� �(logcvir) = 0.18 at a given mass, corresponding to a scatter in maximum rotation velocities of �Vmax/Vmax = 0.12. We discuss implications for modelling the Tully-Fisher relation, which has a smaller reported intrinsic scatter. Third, subhaloes and haloes in dense environments tend to be more concentrated than isolated haloes, and show a larger scatter. These results suggest that cvir is an essential parameter for the theory of galaxy modelling, and we briefly discuss implications for the universality of the Tully- Fisher relation, the formation of low surface brightness galaxies, and the origin of the Hubble sequence. We present an improved analytic treatment of halo formation that fits the measured relations between halo parameters and their redshift dependence, and can thus serve semi-analytic studies of galaxy formation.

/pdf/profiles-of-dark-haloes-evolution-scatter-and-environment-eh4lwirqo8.pdf

Profiles of dark haloes: evolution, scatter and environment

We use N-body simulations on highly parallel supercomputers to study the structure of Galactic dark matter halos. The systems form by gravitational collapse from scale-free and more general Gaussian initial density perturbations in an expanding 400 Mpc 3 spherical slice of an Einstein-deSitter universe. We use N∼10 6 and a force softening e=5 kpc in most of our models. We analyze the structure and kinematics of the ∼10 2 largest relaxed halos in each of 10 separate simulations

Dark halos formed via dissipationless collapse. I: Shapes and alignment of angular momentum

Intersection calculations dominate the run time of canonical ray tracers. A common algorithm to reduce the number of intersection tests required is the intersection of rays with a tree of extents, rather than the whole database of objects. A shortcoming of this method is that these trees are difficult to generate. Additionally, manually generated trees can be poor, greatly reducing the run-time improvement available. We present methods for evaluation of these trees in approximate number of intersection calculations required and for automatic generation of good trees. These methods run in O(nlogn) expected time where n is the number of objects in the scene. We report some examples of speedups.

/pdf/automatic-creation-of-object-hierarchies-for-ray-tracing-9eb2zp9js9.pdf

Automatic Creation of Object Hierarchies for Ray Tracing

The authors report on an efficient adaptive N-body method which we have recently designed and implemented. The algorithm computes the forces on an arbitrary distribution of bodies in a time which scales as N log N with the particle number. The accuracy of the force calculations is analytically bounded, and can be adjusted via a user defined parameter between a few percent relative accuracy, down to machine arithmetic accuracy. Instead of using pointers to indicate the topology of the tree, the authors identify each possible cell with a key. The mapping of keys into memory locations is achieved via a hash table. This allows the program to access data in an efficient manner across multiple processors. Performance of the parallel program is measured on the 512 processor Intel Touchstone Delta system. Comments on a number of wide-ranging applications which can benefit from application of this type of algorithm are included.

/pdf/a-parallel-hashed-oct-tree-n-body-algorithm-16s3fp1qmi.pdf

A parallel hashed oct-tree N-body algorithm

A framework for delivery of Internet content includes a subscriber server network; and at least one domain name server constructed and adapted to provide policy-based domain name service, wherein, in response to a request to resolve a hostname, the domain name server resolves the hostname to at least one address corresponding a server in the subscriber server network based on at least one policy consideration. The framework may include a content delivery network, distinct from the subscriber server network, wherein, in response to a request to resolve a hostname, the domain name server provides at least one addresses of a server in the content delivery network based at least on the location of the requestor and other policy considerations. An address returned by the domain name server is selected based on one or more of: (a) geographic policies; (b) load share policies; (c) overflow policies; and (d) network aware policies.

John K. Salmon

Papers

Dark halos formed via dissipationless collapse. I: Shapes and alignment of angular momentum

Automatic Creation of Object Hierarchies for Ray Tracing

A parallel hashed oct-tree N-body algorithm

Configurable adaptive global traffic control and management

Skeletons from the treecode closet