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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - International Conference of the Chilean Computer Science Society s. 1 - 3
Hlavní autoři: Rodriguez, Pedrio A., Rivara, Maria Cecilia
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2013
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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