Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Latency-Optimized Parallelization of the FMM Near-Field Computations

Ivo KabadshowContact Information and Bruno Lang2

(1)  John von Neumann Institute for Computing, Central Institute for Applied Mathematics, Research Centre Jülich, Germany
(2)  Applied Computer Science and Scientific Computing Group, Department of Mathematics, University of Wuppertal, Germany
Abstract
In this paper we present a new parallelization scheme for the FMM near-field. The parallelization is based on the Global Arrays Toolkit and uses one-sided communication with overlapping. It employs a purely static load-balancing approach to minimize the number of communication steps and benefits from a maximum utilization of data locality. In contrast to other implementations the communication is initiated by the process owning the data via a put call, not the process receiving the data (via a get call).

Contact Information Ivo Kabadshow
Email: i.kabadshow@fz-juelich.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.110 • Server: mpweb02
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)