Edge Split Mapping Parallel Algorithm for Tetrahedral Mesh Refinement on Distributed Memory Systems
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
Balman M. Tetrahedral Mesh Refinement in Distributed Envi-ronments. In ICPP Workshops 2006; 497–504p.
Bedregal C., Rivara M. C.. A Study on Size-optimal Longest Edge Refinement Algorithms. In: proceedings of the 21st International Meshing Roundtable, 2013, 121–136p.
Rivara M. C. New Longest-edge Algorithms for the Re-finement for Improvement of Unstructured Triangulations. Int. J. Numer. Meth. Eng. 1997; 40(18): 3313–3324p.
Rivara M. C. Lepp-bisection Algorithms, Applications and Mathematical Properties. Appl. Numer. Math. 2009; 59(9): 2218– 2235p.
Jones M. T., Plassmann P. E. Parallel Algorithms for Adap-tive Mesh Refinement. SIAM J. Sci. Compu. 1997; 18(3): 686–708p.
Castaños J. G., Savage J. E. Parallel Refinement of Unstructured Meshes.
Technical Report cs-99-10, Department of Computer Science, Brown University.
Rivara M. C., Rodriguez P., Montenegro R., et al. Multithread Parallelization of Lepp-Bisection Algorithms. Appl. Numer. Math. 2012; 62(4): 473–488p.
Rodriguez P., Rivara M. C., Scherson I. D. Exploiting the Memory Hierarchy of Multicore Systems for Parallel Triangula-tion Refinement. Parall. Process. Lett. 2012; 22(3).
- There are currently no refbacks.
This site has been shifted to https://stmcomputers.stmjournals.com/