Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel Languages | Zendy

Yu Hu | Zendy; S. Lennart Johnsson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel Languages

Author(s) -

Yu Hu,

S. Lennart Johnsson

Publication year - 1995

Publication title -

scientific programming

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.269

H-Index - 36

eISSN - 1875-919X

pISSN - 1058-9244

DOI - 10.1155/1996/425936

Subject(s) - fortran , computer science , hierarchy , node (physics) , parallel computing , connection (principal bundle) , focus (optics) , algorithm , parallel algorithm , mathematics , programming language , physics , geometry , structural engineering , optics , economics , engineering , market economy

The optimization techniques for hierarchical O(N) N-body algorithms described here focus on managing the data distribution and the data references, both between the memories of different nodes and within the memory hierarchy of each node. We show how the techniques can be expressed in data-parallel languages, such as High Performance Fortran (HPF) and Connection Machine Fortran (CMF). The effectiveness of our techniques is demonstrated on an implementation of Anderson's hierarchical O(N) N-body method for the Connection Machine system CM-5/5E. Of the total execution time, communication accounts for about 10–20% of the total time, with the average efficiency for arithmetic operations being about 40% and the total efficiency (including communication) being about 35%. For the CM-5E, a performance in excess of 60 Mflop/s per node (peak 160 Mflop/s per node) has been measured

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research