Parallel Lepp-Bisection Algorithm over Distributed Memory Systems

We discuss a parallel Lepp-bisection algorithm for two-dimensional mesh refinement over distributed memory systems. We discuss the subdivision of the mesh and the management of interface refinement and communication. We also study the empirical algorithm behavior.

Saved in:
Bibliographic Details
Published in:Proceedings - International Conference of the Chilean Computer Science Society pp. 1 - 3
Main Authors: Rodriguez, Pedrio A., Rivara, Maria Cecilia
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2013
Subjects:
Algorithm design and analysis
Computer science
distributed memory
Lepp
Lepp-bisection
Libraries
longest edge
mesh partition
Message passing
Parallel algorithms
parallel system
Partitioning algorithms
Program processors
refinement
ISSN:1522-4902
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We discuss a parallel Lepp-bisection algorithm for two-dimensional mesh refinement over distributed memory systems. We discuss the subdivision of the mesh and the management of interface refinement and communication. We also study the empirical algorithm behavior.
ISSN:1522-4902
DOI:10.1109/SCCC.2013.32