Flores et al 2017b - Revision history

Scipediacontent at 10:09, 14 June 2017

2017-06-14T10:09:04Z

Scipediacontent: Scipediacontent moved page Draft Content 474735366 to Flores et al 2017b

2017-05-26T08:21:19Z

Scipediacontent moved page Draft Content 474735366 to Flores et al 2017b

Scipediacontent: Created page with "== Abstract == El código PUMI se ha desarrollado en CIMNE para resolver rápidamente problemas de flujo compresible alrededor de geometrías complejas. En la actualidad se l..."

2017-05-26T07:48:01Z

Created page with "== Abstract == El código PUMI se ha desarrollado en CIMNE para resolver rápidamente problemas de flujo compresible alrededor de geometrías complejas. En la actualidad se l..."

New page

== Abstract ==

El código PUMI se ha desarrollado en CIMNE para resolver rápidamente problemas de flujo compresible alrededor de geometrías complejas. En la actualidad se llevan a cabo de manera rutinaria cálculos con mallas que contienen decenas de millones de elementos. PUMI fue diseñado específicamente para tratar problemas de esta escala usando hardware modesto; por tanto la eficiencia del código ha sido uno de los objetivos fundamentales durante su diseño. Se buscó una utilización mínima de memoria, excelente comportamiento en entornos de ejecución secuencial y escalado satisfactorio hasta un número moderado de procesos (para su uso eficiente en estaciones de trabajo multiprocesador). Para facilitar en lo posible las tareas de generación de mallas se eligió una formulación no estucturada basada en elementos finitos. El presente artículo describe los fundamentos teóricos del algoritmo así como detalles de implementación que mejoran la robustez y eficiencia del código. Summary The PUMI flow solver has been developed at CIMNE in order to address the need for fast solutions of the flow field around complex geometries. Nowadays calculations involving a number of cells on the order of tens of millions are performed routinely. PUMI was created to deal with this kind of large-scale problem using modest hardware, therefore special emphasis was placed on the computational efficiency of the code. Design guidelines where minimum memory requirement, very fast single-threaded performance as well as satisfactory parallel scaling up to a moderate number of threads (as found on current entry-level SMP workstations). In order to simplify the mesh generation activities an unstructured finite element formulation was selected. This paper describes the theoretical basis of the algorithm as well as details of the implementation that increase the robustness and efficiency of the code.

== Full document ==
<pdf>Media:draft_Content_474735366RR272D.pdf</pdf>

@@ Line 1: / Line 1: @@
 == Abstract ==
-El código PUMI se ha desarrollado en CIMNE para resolver rápidamente problemas de flujo compresible alrededor de geometrías complejas. En la actualidad se llevan a cabo de manera rutinaria cálculos con mallas que contienen decenas de millones de elementos. PUMI fue diseñado específicamente para tratar problemas de esta escala usando hardware modesto; por tanto la eficiencia del código ha sido uno de los objetivos fundamentales durante su diseño. Se buscó una utilización mínima de memoria, excelente comportamiento en entornos de ejecución secuencial y escalado satisfactorio hasta un número moderado de procesos (para su uso eficiente en estaciones de trabajo multiprocesador). Para facilitar en lo posible las tareas de generación de mallas se eligió una formulación no estucturada basada en elementos finitos. El presente artículo describe los fundamentos teóricos del algoritmo así como detalles de implementación que mejoran la robustez y eficiencia del código. Summary The PUMI flow solver has been developed at CIMNE in order to address the need for fast solutions of the flow field around complex geometries. Nowadays calculations involving a number of cells on the order of tens of millions are performed routinely. PUMI was created to deal with this kind of large-scale problem using modest hardware, therefore special emphasis was placed on the computational efficiency of the code. Design guidelines where minimum memory requirement, very fast single-threaded performance as well as satisfactory parallel scaling up to a moderate number of threads (as found on current entry-level SMP workstations). In order to simplify the mesh generation activities an unstructured finite element formulation was selected. This paper describes the theoretical basis of the algorithm as well as details of the implementation that increase the robustness and efficiency of the code.
+The PUMI flow solver has been developed at CIMNE in order to address the need for fast solutions of the flow field around complex geometries. Nowadays calculations involving a number of cells on the order of tens of millions are performed routinely. PUMI was created to deal with this kind of large-scale problem using modest hardware, therefore special emphasis was placed on the computational efficiency of the code. Design guidelines where minimum memory requirement, very fast single-threaded performance as well as satisfactory parallel scaling up to a moderate number of threads (as found on current entry-level SMP workstations). In order to simplify the mesh generation activities an unstructured finite element formulation was selected. This paper describes the theoretical basis of the algorithm as well as details of the implementation that increase the robustness and efficiency of the code.
 == Full document ==
 <pdf>Media:draft_Content_474735366RR272D.pdf</pdf>

← Older revision	Revision as of 08:21, 26 May 2017
(No difference)