A quasi‐cache‐aware model for optimal domain partitioning in parallel geometric multigrid
- Submitting institution
-
The University of Leeds
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- UOA11-742
- Type
- D - Journal article
- DOI
-
10.1002/cpe.4328
- Title of journal
- Concurrency and Computation: Practice and Experience
- Article number
- e4328
- First page
- -
- Volume
- 30
- Issue
- 9
- ISSN
- 1532-0626
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
D - CSE (Computational Science and Engineering)
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The nine papers selected for this special issue are “extended versions of the best papers presented at the 2016 IEEE International conference on HPCS (HPCS 2016), which took place in Innsbruck, Austria, July 18-22 2016” (editorial DOI: 10.1002/cpe.4431). The original conference paper was one of 53 regular papers out of a total of 137 papers submitted to the main track (38.69%). The main contribution of the paper is to demonstrate that domain decomposition based upon communication minimization, which is almost universally used is, sub-optimal and to provide a model for improving the domain decomposition algorithm for this class of problem.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
