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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we specifically present a parallel solution to finding theone-ring neighboring nodes and elements for each vertex in generic meshes. Thefinding of nodal neighbors is computationally straightforward but expensive forlarge meshes. To improve the efficiency, the parallelism is adopted byutilizing the modern Graphics Processing Unit (GPU). The presented parallelsolution is heavily dependent on the parallel sorting, scan, and reduction, andcan be applied to determine both the neighboring nodes and elements. Toevaluate the performance, the parallel solution is compared to thecorresponding serial solution. Experimental results show that: our parallelsolution can achieve the speedups of approximately 55 and 90 over thecorresponding serial solution for finding neighboring nodes and elements,respectively. Our parallel solution is efficient and easy to implement, butrequires the allocation of large device memory.

A Parallel Solution to Finding Nodal Neighbors in Generic Meshes