A quasi‐cache‐aware model for optimal domain partitioning in parallel geometric multigrid. (9th October 2017)
- Record Type:
- Journal Article
- Title:
- A quasi‐cache‐aware model for optimal domain partitioning in parallel geometric multigrid. (9th October 2017)
- Main Title:
- A quasi‐cache‐aware model for optimal domain partitioning in parallel geometric multigrid
- Authors:
- Saxena, Gaurav
Jimack, Peter K.
Walkley, Mark A. - Other Names:
- Limet Sébastien guestEditor.
Merlo Alessio guestEditor.
Spalazzi Luca guestEditor. - Abstract:
- Summary: Stencil computations form the heart of numerical simulations to solve Partial Differential Equations using Finite Difference, Finite Element, and Finite Volume methods. Geometric Multigrid is an optimal O ( N ), hierarchical tool employing stencil computations in its chief constituents, namely, smoothing, restriction, and interpolation. When Multigrid is parallelized over distributed‐shared memory architectures, traditionally, the domain partitioning creates cubic partitions of the mesh to minimize overall communication. Thus, the orthodox approach considers only load‐balancing and communication minimization for completely determining the domain partitioning. In this article, we show that these two factors are not sufficient to obtain optimal partitions for Parallel Geometric Multigrid. To this effect, we develop and validate a high level analytical model to show that "close to 2‐D" partitions for Geometric Multigrid can give higher performance than the partitions returned by theMPI_Dims_create() function which minimizes the communication volume by default. We quantify sub‐domain level cache‐misses in Parallel Geometric Multigrid and obtain families of optimal domain partitions. We conclude that the sub‐domain level cache‐misses for the application‐specific stencil computational kernel and communicated planes should be taken into account in addition to communication minimization/load‐balance to obtain optimal partitions for Parallel Geometric Multigrid.
- Is Part Of:
- Concurrency and computation. Volume 30:Number 9(2018)
- Journal:
- Concurrency and computation
- Issue:
- Volume 30:Number 9(2018)
- Issue Display:
- Volume 30, Issue 9 (2018)
- Year:
- 2018
- Volume:
- 30
- Issue:
- 9
- Issue Sort Value:
- 2018-0030-0009-0000
- Page Start:
- n/a
- Page End:
- n/a
- Publication Date:
- 2017-10-09
- Subjects:
- cache misses -- domain partitioning -- geometric multigrid -- quasi‐cache‐aware -- stencil -- topology
Parallel processing (Electronic computers) -- Periodicals
Parallel computers -- Periodicals
004.35 - Journal URLs:
- http://onlinelibrary.wiley.com/ ↗
- DOI:
- 10.1002/cpe.4328 ↗
- Languages:
- English
- ISSNs:
- 1532-0626
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3405.622000
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 9356.xml