Abstract
Cosmological simulators are currently an important component in the study of the formation of galaxies and planetary systems. However, existing simulators do not scale effectively on more recent machines containing thousands of processors. In this paper, we introduce a new parallel simulator called ChaNGa (Charm N-body Gravity). This simulator is based on the Charm++ infrastructure, which provides a powerful runtime system that automatically maps computation to physical processors. Using Charm++ features, in particular its measurement-based load balancers, we were able to scale the gravitational force calculation of ChaNGa on up to one thousand processors, with astronomical datasets containing millions of particles. As we pursue the completion of a production version of the code, our current experimental results show that ChaNGa may become a powerful resource for the astronomy community.
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
Preview
Unable to display preview. Download preview PDF.
References
Dikaiakos, M.D., Stadel, J.: A performance study of cosmological simulations on message-passing and shared-memory multiprocessors. In: Proceedings of the International Conference on Supercomputing - ICS’96, Philadelphia, PA, December 1996, pp. 94–101 (1996)
Kale, L.V., Krishnan, S.: Charm++: Parallel Programming with Message-Driven Objects. In: Wilson, G.V., Lu, P. (eds.) Parallel Programming using C++, pp. 175–213. MIT Press, Cambridge (1996)
Kalé, L.V.: Performance and productivity in parallel programming via processor virtualization. In: Proc. of the First Intl. Workshop on Productivity and Performance in High-End Computing (at HPCA 10), Madrid, Spain (February 2004)
Barnes, J., Hut, P.: A hierarchical O(N logN) force-calculation algorithm. Nature 324, 446–449 (1986)
Lake, G., Katz, N., Quinn, T.: Cosmological N-body simulation. In: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, February 1995, pp. 307–312. SIAM, Philadelphia (1995)
Springel, V., Yoshida, N., White, S.: GADGET: A code for collisionless and gasdynamical simulations. New Astronomy 6, 79–117 (2001)
Dehnen, W.: A hierarchical O(N) force calculation algorithm. Journal of Computational Physics 179, 27–42 (2002)
Springel, V.: The cosmological simulation code GADGET-2. MNRAS 364, 1105–1134 (2005)
Phillips, J.C., et al.: NAMD: Biomolecular simulation on thousands of processors. In: Proceedings of SC 2002, Baltimore, MD (September 2002)
Zheng, G.: Achieving High Performance on Extremely Large Parallel Machines: Performance Prediction and Load Balancing. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign (2005)
Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. Journal of Computational Physics 73, 325–348 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gioachin, F., Sharma, A., Chakravorty, S., Mendes, C.L., Kalé, L.V., Quinn, T. (2007). Scalable Cosmological Simulations on Parallel Machines. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)