English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We discuss parallel algorithms to gather topological information aboutoff-process mesh neighbor elements. This information is commonly called theghost layer, whose creation is a fundamental, necessary task in executing mostparallel, element-based computer simulations. Approaches differ in that theghost layer may either be inherently part of the mesh data structure that ismaintained and modified, or kept separate and constructed/deleted as needed.  In this work, we present an updated design following the latter approach,which we favor for its modularity of algorithms and data structures. We targetarbitrary adaptive, non-conforming forest-of-(oc)trees meshes of mixed elementshapes, such as cubes, prisms, and tetrahedra, and restrict ourselves toface-ghosts. Our algorithm has low complexity and redundancy since we reduce itto generic codimension-1 subalgorithms that can be flexibly combined. We coverseveral existing solutions as special cases and optimize further usingrecursive, amortized tree searches and traversals.

An Optimized, Parallel Computation of the Ghost Layer for Adaptive Hybrid Forest Meshes