N-body algorithms and parallelization of them
Xiao Wang · Jisuanji yu yingyong huaxue · 2003
The N-body problem covers many fields in science and technology, which is computationally intensive for O(N2) complexity, thus a candidate for parallel computation. Many algorithms have been developed according to the character of this problem and the architecture of the parallel computers, which effectively reduced the computational work and fastened the speed. Several algorithms for N-body problem and the parallelization of them are introduced in this paper.