vix.ing · top · new · best · stats · spec

Performance Evaluation of Treecode Algorithm for N-Body Simulation Using GridRPC System

2012/11/10 by Truong Vinh Truong Duy, Duy, Truong Vinh Truong, Katsuhiro Yamazaki +3
Computer Science · #Advanced Data Storage Technologies #Computational Engineering #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Finance #Parallel #Parallel Computing and Optimization Techniques #Performance (cs.PF) #and Cluster Computing (cs.DC) #and Science (cs.CE) #cs.CE #cs.DC #cs.PF

paper · pdf · doi:10.48550/arxiv.1211.2293

4 pages, 9 figures

arxiv created 2012/11/10 · openalex publication_date 2012/11/10 · arxiv updated 2012/11/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

This paper is aimed at improving the performance of the treecode algorithm for N-Body simulation by employing the NetSolve GridRPC programming model to exploit the use of multiple clusters. N-Body is a classical problem, and appears in many areas of science and engineering, including astrophysics, molecular dynamics, and graphics. In the simulation of N-Body, the specific routine for calculating the forces on the bodies which accounts for upwards of 90% of the cycles in typical computations is eminently suitable for obtaining parallelism with GridRPC calls. It is divided among the compute nodes by simultaneously calling multiple GridRPC requests to them. The performance of the GridRPC implementation is then compared to that of the MPI version and hybrid MPI-OpenMP version for the treecode algorithm on individual clusters.

Citations

Related