Abstract
On serial computers it is well known that the multigrid FMV cycle is preferable to the V cycle both asymptotically and in practical use over a wide range of applications. However, on massively parallel machines, the parallel efficiency of the FMV (full multigrid V cycle) scheme is noticeably lower than that of the V cycle due to a large percentage of time spent on coarse grids. Thus the question arises: are the additional coarse grid computations within the FMV cycle warranted on massively parallel machines? To answer this, a number of issues are addressed regarding parallel FMV cycles: what efficiencies can be achieved; how do these compare with V cycle efficiencies; are FMV cycles still preferable to V cycles in a massively parallel environment? A model is used to analyze the efficiency of both FMV and V cycles as a function of relaxation efficiency. Using this model, the standard FMV grid-switching criterion is modified to incorporate the efficiency of the coarse grid processing. Numerical results obtained from a multigrid implementation on a 1024-processor nCUBE 2 are used in conjunction with the model to quantify the performance and efficiency of the FMV cycle. Finally, comments are made regarding limitations of parallel processors based on FMV efficiencies.
Keywords
Related Publications
AMBERCUBE MD, parallelization of Amber's molecular dynamics module for distributed‐memory hypercube computers
Abstract A fully functional parallel version of the molecular dynamics (MD) module of AMBER3a has been implemented. Procedures parallelized include the calculation of the long‐r...
A Grid-Enabled MPI: Message Passing in Heterogeneous Distributed Computing Systems
Application development for high-performance distributed computing systems, or computational grids as they are sometimes called, requires grid-enabled tools that hide mundate as...
MapReduce: Simplified Data Processing on Large Cluster
<p>Abstract - MapReduce is a data processing approach, where a single machine acts as a master, assigning map/reduce tasks to all the other machines attached in the cluste...
Dryad
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational "vertices" with communication "ch...
The adaptive multilevel finite element solution of the Poisson-Boltzmann equation on massively parallel computers
By using new methods for the parallel solution of elliptic partial differential equations, the teraflops computing power of massively parallel computers can be leveraged to perf...
Publication Info
- Year
- 1993
- Type
- article
- Volume
- 14
- Issue
- 5
- Pages
- 1159-1173
- Citations
- 7
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1137/0914069