Abstract
We have analyzed the effect of vectorization on several schemes of direct N-body integration. We find that an Aarseth-type code with a neighbour scheme, which is the fastest on a scalar processor, is still the fastest on vector processors for large N. For N=1000, the overall gain in speed is found to be a factor of 10 both in theory and experiment. In the presence of hard binaries, however, the gain is reduced significantly.
Preview
Unable to display preview. Download preview PDF.
References
Aarseth, S. J. (1985), in Multiple Time Scales, eds J. U. Brackbill and B. I. Cohen (Academic Press, New York), p 377.
Aarseth, S. J. (1963), Mon. Not. Roy. Astron. Soc., 126, 223.
Ahmad, A. and Cohen, L. (1973), J. Comp. Phys., 12, 389.
Makino, J. and Hut, P. (1986), in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Makino, J. (1986). Direct N-body simulation on supercomputers. In: Hut, P., McMillan, S.L.W. (eds) The Use of Supercomputers in Stellar Dynamics. Lecture Notes in Physics, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0116405
Download citation
DOI: https://doi.org/10.1007/BFb0116405
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17196-6
Online ISBN: 978-3-540-47361-9
eBook Packages: Springer Book Archive