Edge Split Mapping Parallel Algorithm for Tetrahedral Mesh Refinement on Distributed Memory Systems

Ankush Rai

doi:10.37591/rtpc.v1i1.145

Edge Split Mapping Parallel Algorithm for Tetrahedral Mesh Refinement on Distributed Memory Systems

Ankush Rai

Abstract

In this paper we have described a parallel mesh refining algorithm based on edge split mapping parallel algorithm for on a distributed memory system; that aids the user in auto-managing the assignment of processor workload and subdivision of the 3d-mesh. We discussed the design and performance of the algorithm which speeds up the processing of the instructions over a multi-core processor.Keywords: Parallel algorithm, Distributed memory, Mesh Refinement

Full text

The full text of this article is available to subscribers.

On a subscribing campus you are let in by network address, with no login at all.

Buy this article ₹1,500 $30

One-off purchase. Permanent access to this article, no account needed.

How to cite

Ankush Rai. Edge Split Mapping Parallel Algorithm for Tetrahedral Mesh Refinement on Distributed Memory Systems. Recent Trends in Parallel Computing. 2020;1(2):15–18. https://doi.org/10.37591/rtpc.v1i1.145

Download the citation:

BibTeX RIS EndNote

Article details

Journal: Recent Trends in Parallel Computing
Issue: Volume 1, Issue 2 (2014)
Pages: 15–18
Published: Feb. 24, 2020
DOI: 10.37591/rtpc.v1i1.145

Publish with us

Submit your research to Recent Trends in Parallel Computing — peer-reviewed, open access options available.

Submit a manuscript →