Publication:

A Data-Parallel Implementation of O(N) Hierarchical N-body Methods

Thumbnail Image

Open/View Files

tr-05-96.pdf (271.91 KB)

Date

1996

Authors

Published Version

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Hu, Yu, and S. Lennart Johnsson. 1996. A Data-Parallel Implementation of O(N) Hierarchical N-body Methods. Harvard Computer Science Group TR-05-96.

Abstract

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 present 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%. The evaluation of the potential field of a system of 100 million particles takes 3 minutes and 15 minutes on a 256 node CM–5E, giving expected four and seven digits of accuracy, respectively. The speed of the code scales linearly with the number of processors and number of particles.

Description

Other Available Sources

Research Data

Keywords

N-body simulaiton, multipole algorithms, hierarchical N-body methods, data-parallel programming, massively parallel processors

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

URI

http://nrs.harvard.edu/urn-3:HUL.InstRepos:24019784

Collections

FAS Scholarly Articles

Endorsement

Review

Supplemented By

Related Stories