Change search
ReferencesLink to record
Permanent link

Direct link
Implementing O(N ) N–body algorithms efficiently in data parallel languages
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1996 (English)In: Scientific Programming, ISSN 1058-9244, E-ISSN 1875-919X, Vol. 5, no 4, 337-364 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
1996. Vol. 5, no 4, 337-364 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-90979OAI: diva2:507629
NR 20140805Available from: 2012-03-05 Created: 2012-03-05Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
In the same journal
Scientific Programming
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 25 hits
ReferencesLink to record
Permanent link

Direct link