Abstract
This article presents an algorithm conceived to improve the computational efficiency of simulations in ESyS-Particle that involve a large number of particles. ESyS-Particle applies the Discrete Element Method to simulate the interaction of agglomerates of particles. The proposed algorithm is based on the Barnes & Hut method, in which a domain is divided and organized in an octal tree. The algorithm is compared to a variation of the octal tree version that uses a binary tree instead. Experimental evaluation is performed over two scenarios: a collapsing cube scenario and two agglomerates orbiting each other. The experimental evaluation comprises the performance analysis of the two scenarios using the two algorithms, including a comparison of the results obtained and the analysis of the numerical accuracy. Results indicate that the octal tree version performs faster and is more accurate than the binary tree version.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Harris, A., Fahnestock, E., Pravec, P.: On the shapes and spins of “rubble pile” asteroids. Icarus 199(2), 310–318 (2009)
Fujiwara, A., et al.: The rubble-pile asteroid itokawa as observed by hayabusa. Science 312(5778), 1330–1334 (2006)
Walsh, K., Richardson, D., Michel, P.: Spin-up of rubble-pile asteroids: disruption, satellite formation, and equilibrium shapes. Icarus 220(2), 514–529 (2012)
Goldreich, P., Sari, R.: Tidal evolution of rubble piles. Astrophys. J. 691(1), 54 (2009)
Rozitis, B., MacLennan, E., Emery, J.: Cohesive forces prevent the rotational breakup of rubble-pile asteroid (29075) 1950 DA. Nature 512(7513), 174–176 (2014)
Cundall, P., Strack, O.: A discrete numerical model for granular assemblies. Geotechnique 29(1), 47–65 (1979)
Abe, S., et al.: ESyS-Particle: HPC Discrete Element Modeling Software. Open Software License version, 3 (2009)
Frascarelli, D., Nesmachnow, S., Tancredi, G.: High-performance computing of self-gravity for small solar system bodies. Computer 47(9), 34–39 (2014)
Nesmachnow, S., Frascarelli, D., Tancredi, G.: A parallel multithreading algorithm for self-gravity calculation on agglomerates. In: Gitler, I., Klapp, J. (eds.) ISUM 2015. CCIS, vol. 595, pp. 311–325. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-32243-8_22
Rocchetti, N., Frascarelli, D., Nesmachnow, S., Tancredi, G.: Performance improvements of a parallel multithreading self-gravity algorithm. In: Mocskos, E., Nesmachnow, S. (eds.) CARLA 2017. CCIS, vol. 796, pp. 291–306. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73353-1_21
Hockney, R., Eastwood, J.: Computer Simulation Using Particles. CRC Press, London (1988)
Darden, T., York, D., Pedersen, L.: Particle mesh ewald: an n\(\cdot \) log (n) method for ewald sums in large systems. J. Chem. Phys. 98(12), 10089–10092 (1993)
Essmann, U., Perera, L., Berkowitz, M.L., Darden, T., Lee, H., Pedersen, L.G.: A smooth particle mesh ewald method. J. Chem. Phys. 103(19), 8577–8593 (1995)
Sánchez, P., Scheeres, D.: Dem simulation of rotation-induced reshaping and disruption of rubble-pile asteroids. Icarus 218(2), 876–894 (2012)
Kravtsov, A., Klypin, A., Khokhlov, A.: Adaptive refinement tree: a new high-resolution N-body code for cosmological simulations. Astrophys. J. Suppl. Ser. 111(1), 73 (1997)
Couchman, H.: Mesh-refined P3M-A fast adaptive N-body algorithm. Astrophys. J. 368, L23–L26 (1991)
MacFarland, T., Couchman, H., Pearce, F., Pichlmeier, J.: A new parallel P3M code for very large-scale cosmological simulations. New Astron. 3(8), 687–705 (1998)
Harnois-Déraps, J., Pen, U., Iliev, I., Merz, H., Emberson, J., Desjacques, V.: High-performance P3M N-body code: CUBEP3M. Mon. Not. R. Astron. Soc. 436(1), 540–559 (2013)
Brieu, P., Summers, F., Ostriker, J.: Cosmological simulations using special purpose computers: implementing P3M on GRAPE. Astrophys. J. Suppl. 453, 566–575 (1995)
Barnes, J., Hut, P.: A hierarchical O(\(N\)\(\log \)\(N\)) force-calculation algorithm. Nature 324(6096), 446–449 (1986)
Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. J. Comput. Phys. 73(2), 325–348 (1987)
Xu, G.: A new parallel N-body gravity solver: TPM. Astrophys. J. Suppl. 98, 355–376 (1994)
Bode, P., Ostriker, J., Xu, G.: The tree particle-mesh n-body gravity solver. Astrophys. J. Suppl. Ser. 128(2), 561 (2000)
Bagla, J.: Treepm: a code for cosmological n-body simulations. J. Astrophys. Astron. 23(3), 185–196 (2002)
Khandai, N., Bagla, J.: A modified TreePM code. Res. Astron. Astrophys. 9(8), 861 (2009)
Nesmachnow, S.: Computación científica de alto desempeño en la Facultad de Ingeniería, Universidad de la República. Revista de la Asociación de Ingenieros del Uruguay 61(1), 12–15 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Rocchetti, N., Nesmachnow, S., Tancredi, G. (2019). Comparison of Tree Based Strategies for Parallel Simulation of Self-gravity in Agglomerates. In: Meneses, E., Castro, H., Barrios Hernández, C., Ramos-Pollan, R. (eds) High Performance Computing. CARLA 2018. Communications in Computer and Information Science, vol 979. Springer, Cham. https://doi.org/10.1007/978-3-030-16205-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-16205-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16204-7
Online ISBN: 978-3-030-16205-4
eBook Packages: Computer ScienceComputer Science (R0)