A new, efficient pipelined communication strategy that significantly reduces latency for parallel 3-D finite element mesh refinement with tetrahedra is proposed. A Petri Nets-based model is developed in order to simulate the interprocessor communication costs for both the target mesh refinement algorithm and parallel architecture. Benchmark results show that the new pipelined design yields improved communication performance and overall parallel speedup for a range of refinement problem sizes, using different numbers of processors
There are numerous scientific applications which require large and complex meshes. Given the explos...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
This paper presents three parallel algorithms for simulation of axisymmetrical metal forging pro- ce...
Optimal partitioning of three-dimensional (3-D) mesh applications necessitates dynamically determini...
Efficient data motion is critical for high performance computing on distributed memory architectures...
Massively parallel computing holds the promise of extreme performance. Critical for achieving high p...
[EN]We propose a new algorithm on distributed-memory parallel computers for our simultaneous untangl...
We present the results of an evaluation study on the re-structuring of a latency-bound mesh generati...
AbstractA multi-threaded parallel local reconnection algorithm is proposed for tetrahedral meshes. I...
In this work we present a new alternate way to formulate the finite element method (FEM) for paralle...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
The paper presents a parallel tetrahedral mesh generation approach based on recursive bidivisions us...
The accurate modeling of the nonlinear properties of materials can be computationally expensive. Par...
AbstractWe describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedra...
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount...
There are numerous scientific applications which require large and complex meshes. Given the explos...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
This paper presents three parallel algorithms for simulation of axisymmetrical metal forging pro- ce...
Optimal partitioning of three-dimensional (3-D) mesh applications necessitates dynamically determini...
Efficient data motion is critical for high performance computing on distributed memory architectures...
Massively parallel computing holds the promise of extreme performance. Critical for achieving high p...
[EN]We propose a new algorithm on distributed-memory parallel computers for our simultaneous untangl...
We present the results of an evaluation study on the re-structuring of a latency-bound mesh generati...
AbstractA multi-threaded parallel local reconnection algorithm is proposed for tetrahedral meshes. I...
In this work we present a new alternate way to formulate the finite element method (FEM) for paralle...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
The paper presents a parallel tetrahedral mesh generation approach based on recursive bidivisions us...
The accurate modeling of the nonlinear properties of materials can be computationally expensive. Par...
AbstractWe describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedra...
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount...
There are numerous scientific applications which require large and complex meshes. Given the explos...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
This paper presents three parallel algorithms for simulation of axisymmetrical metal forging pro- ce...