Fine-grained Locality-aware Parallel Scheme for Anisotropic Mesh Adaptation

Abstract : In this paper, we provide a fine-grained parallel scheme for anisotropic mesh adaptation on NUMA1 architectures. Data dependencies are expressed by a graph for each kernel, and concurrency is extracted through fine-grained graph coloring. Tasks are structured into bulk-synchronous steps to avoid data races and to aggregate shared-data accesses. To ensure performance prediction, time cost and load imbalance are theoretically characterized. The devised scheme was evaluated on a 4 NUMA node (2-socket) machine, and a mean efficiency of 70% was reached on 32 cores for 3 kernels out of 4. The impact of irregular degree distribution and data layout on scalability is highlighted.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01432988
Contributor : Frédéric Davesne <>
Submitted on : Thursday, October 10, 2019 - 1:31:40 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

File

RLP-IMR-2016.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Hoby Rakotoarivelo, Franck Ledoux, Franck Pommereau. Fine-grained Locality-aware Parallel Scheme for Anisotropic Mesh Adaptation. 25th International Meshing Roundtable (IMR 2016), Sep 2016, Crystal City, United States. pp.123-135, ⟨10.1016/j.proeng.2016.11.035⟩. ⟨hal-01432988⟩

Share

Metrics

Record views

145

Files downloads

48