A Data Parallel Implementation of Hierarchical N –body Methods
1996 (English)In: International Journal of Supercomputer Applications, Vol. 10, no 1, 3-40 p.Article in journal (Refereed) Published
The O(N) hierarchical N-body algorithms and massively parallel processors allow particle systems of 100 million particles or more to be simulated in acceptable time. We describe a data-parallel implementation of Anderson's method and demonstrate both efficiency and scalability of the implementation on the Connection Machine CM-5/5E systems. The communication time for large particle systems amounts to about 10%-25%, and the overall efficiency is about 35%, corresponding to a performance of about 60 Mflop/s per CM-5E node, independent of the number of nodes.
Place, publisher, year, edition, pages
1996. Vol. 10, no 1, 3-40 p.
FAST MULTIPOLE METHOD; PARTICLE SIMULATIONS; ALGORITHM; PROGRAM
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-90978OAI: oai:DiVA.org:kth-90978DiVA: diva2:507626
NR 201408052012-03-052012-03-05Bibliographically approved