A portable distributed implementation of the parallel multipole tree algorithm

Author

Rankin, William T. ; Board, John A., Jr.

Author_Institution

Dept. of Electr. Eng., Duke Univ., Durham, NC, USA

fYear

1995

fDate

2-4 Aug 1995

Firstpage

17

Lastpage

22

Abstract

Several variants of parallel multipole-based algorithms have been implemented to further research in fields such as computational chemistry and astro-physics. We present a distributed parallel implementation of a multipole-based algorithm that is portable to a wide variety of applications and parallel platforms. Performance data are presented for loosely coupled networks of workstations as well as for more tightly coupled distributed multiprocessors, demonstrating the portability and scalability of the application to large number of processors

Keywords

astronomy computing; chemistry computing; multiprocessing systems; parallel algorithms; computational chemistry; loosely coupled networks; parallel multipole tree algorithm; portable distributed implementation; tightly coupled distributed multiprocessors; Astrochemistry; Computational modeling; Computer applications; Concurrent computing; Costs; Data structures; Fast Fourier transforms; Physics computing; Scalability; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Distributed Computing, 1995., Proceedings of the Fourth IEEE International Symposium on

Conference_Location

Washington, DC

ISSN

1082-8907

Print_ISBN

0-8186-7088-6

Type

conf

DOI

10.1109/HPDC.1995.518690

Filename

518690