English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We propose a hybrid tree algorithm for reducing calculation and communicationcost of collision-less N-body simulations. The concept of our algorithm is thatwe split interaction force into two parts: hard-force from neighbor particlesand soft-force from distant particles, and applying different time integrationfor the forces. For hard-force calculation, we can efficiently reduce thecalculation and communication cost of the parallel tree code because we onlyneed data of neighbor particles for this part. We implement the algorithm onGPU clusters to accelerate force calculation for both hard and soft force. Asthe result of implementing the algorithm on GPU clusters, we were able toreduce the communication cost and the total execution time to 40% and 80% ofthat of a normal tree algorithm, respectively. In addition, the reductionfactor relative the normal tree algorithm is smaller for large number ofprocesses, and we expect that the execution time can be ultimately reduced downto about 70% of the normal tree algorithm.

GPU accelerated Hybrid Tree Algorithm for Collision-less N-body Simulations