skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A parallel adaptive fast multipole method

Abstract

The authors present parallel versions of a representative N-body application that uses Greengard and Rokhlin`s adaptive Fast Multipole Method (FMM). While parallel implementations of the uniform FMM are straightforward and have been developed on different architectures, the adaptive version complicates the task of obtaining effective parallel performance owing to the nonuniform and dynamically changing nature of the problem domains to which it is applied. They propose and evaluate two techniques for providing load balancing and data locality, both of which take advantage of key insights into the method and its typical applications. Using the better of these techniques, they demonstrate 45-fold speedups on galactic simulations on a 48-processor Stanford DASH machine, a state-of-the-art shared address space multiprocessor, even for relatively small problems. They also show good speedups on a 2-ring Kendall Square Research KSR-1. Finally, they summarize some key architectural implications of this important computational method.

Authors:
; ; ;  [1]
  1. Stanford Univ., CA (United States). Computer Systems Lab.
Publication Date:
OSTI Identifier:
46206
Report Number(s):
CONF-931115-
TRN: IM9522%%207
Resource Type:
Conference
Resource Relation:
Conference: Supercomputing conference on high performance computing and communications, Portland, OR (United States), 15-19 Nov 1993; Other Information: PBD: 1993; Related Information: Is Part Of Supercomputing `93: Proceedings; PB: 961 p.
Country of Publication:
United States
Language:
English
Subject:
99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; MANY-BODY PROBLEM; ALGORITHMS; ARRAY PROCESSORS; PARALLEL PROCESSING; TASK SCHEDULING; COMPUTER ARCHITECTURE; USES

Citation Formats

Singh, J P, Holt, C, Hennessy, J L, and Gupta, A. A parallel adaptive fast multipole method. United States: N. p., 1993. Web.
Singh, J P, Holt, C, Hennessy, J L, & Gupta, A. A parallel adaptive fast multipole method. United States.
Singh, J P, Holt, C, Hennessy, J L, and Gupta, A. 1993. "A parallel adaptive fast multipole method". United States.
@article{osti_46206,
title = {A parallel adaptive fast multipole method},
author = {Singh, J P and Holt, C and Hennessy, J L and Gupta, A},
abstractNote = {The authors present parallel versions of a representative N-body application that uses Greengard and Rokhlin`s adaptive Fast Multipole Method (FMM). While parallel implementations of the uniform FMM are straightforward and have been developed on different architectures, the adaptive version complicates the task of obtaining effective parallel performance owing to the nonuniform and dynamically changing nature of the problem domains to which it is applied. They propose and evaluate two techniques for providing load balancing and data locality, both of which take advantage of key insights into the method and its typical applications. Using the better of these techniques, they demonstrate 45-fold speedups on galactic simulations on a 48-processor Stanford DASH machine, a state-of-the-art shared address space multiprocessor, even for relatively small problems. They also show good speedups on a 2-ring Kendall Square Research KSR-1. Finally, they summarize some key architectural implications of this important computational method.},
doi = {},
url = {https://www.osti.gov/biblio/46206}, journal = {},
number = ,
volume = ,
place = {United States},
year = {1993},
month = {12}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: