Related papers: Performance Evaluation of Treecode Algorithm for N…
We present results from our cosmological N-body simulation which consisted of 2048x2048x2048 particles and ran distributed across three supercomputers throughout Europe. The run, which was performed as the concluding phase of the…
We present tests of comparison between our versions of the Fast Multipole Algorithm (FMA) and ``classic'' tree-code to evaluate gravitational forces in particle systems. We have optimized the Greengard's original version of FMA allowing for…
We present a code allowing to evolve three-dimensional self-gravitating collisionless systems with a large number of particles N >= 10^7. FLY (Fast Level-based N-bodY code) is a fully parallel code based on a tree algorithm. It adopts…
A revision of Stodolkiewicz's Monte-Carlo code is used to simulate evolution of star clusters. The new method treats each superstar as a single star and follows the evolution and motion of all individual stellar objects. The first…
Computational protein structure determination involves optimization in a problem space much too large to exhaustively search. Existing approaches include optimization algorithms such as gradient descent and simulated annealing, but these…
The reproducibility of experiments is one of the main principles of the scientific method. However, numerical N-body experiments, especially those of planetary systems, are currently not reproducible. In the most optimistic scenario, they…
Graphics processing units have been extensively used to accelerate classical molecular dynamics simulations. However, there is much less progress on the acceleration of force evaluations for many-body potentials compared to pairwise ones.…
As compute power increases with time, more involved and larger simulations become possible. However, it gets increasingly difficult to efficiently use the provided computational resources. Especially in particle-based simulations with a…
Numerical methods based on tensor networks have been extensively explored in the research of quantum many-body systems in recent years. It has been recognized that the ability of tensor networks to describe a quantum many-body state…
Current AMR simulations require algorithms that are highly parallelized and manage memory efficiently. As compute engines grow larger, AMR simulations will require algorithms that achieve new levels of efficient parallelization and memory…
Coded distributed computing has been considered as a promising technique which makes large-scale systems robust to the "straggler" workers. Yet, practical system models for distributed computing have not been available that reflect the…
A combined N--body/SPH code is presented which benefits from the high speed of the special purpose hardware GRAPE (GRAvity PipE). Besides gravitational forces, GRAPE also returns the list of neighbours and can, therefore, be used to speed…
We report on the performance of our cold-dark matter cosmological N-body simulation which was carried out concurrently using supercomputers across the globe. We ran simulations on 60 to 750 cores distributed over a variety of supercomputers…
We give a full description of the code NBODY2 for direct integration of the gravitational N-body problem. The method of solution is based on the neighbour scheme of Ahmad & Cohen (1973) which speeds up the force calculation already for…
Computational efficiency demands discretised, hierarchically organised, and individually adaptive time-step sizes (known as the block-step scheme) for the time integration of N-body models. However, most existing N-body codes adapt…
The gravitational N-body simulation in the Solar system was performed using different parallel approaches with the comparisons in the computational times and speed-up values being carried out under different model sizes and the number of…
In scientific computing, more computational power generally implies faster and possibly more detailed results. The goal of this study was to develop a framework to submit computational jobs to powerful workstations underused by nonintensive…
Decoupling approach presents a novel solution/alternative to the highly time-consuming fluid-thermal-structural simulation procedures when thermal effects and resultant displacements on machine tools are analyzed. Using high dimensional…
In this paper, we report the implementation and measured performance of our extreme-scale global simulation code on Sunway TaihuLight and two PEZY-SC2 systems: Shoubu System B and Gyoukou. The numerical algorithm is the parallel Barnes-Hut…
A promising new algebraic approach to weighted model counting makes use of tensor networks, following a reduction from weighted model counting to tensor-network contraction. Prior work has focused on analyzing the single-core performance of…