Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topo...
AbstractThis paper addresses two key parallelization challenges the unstructured mesh-based ocean mo...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
Parallelizing large sized problem in parallel systems has always been a challenge for programmer. Th...
We discuss parallel algorithms to compute the ghost layer in computational, distributed memory, recu...
There are numerous scientific applications which require large and complex meshes. Given the explos...
Graph partitioning has been shown to be an effective way to divide a large computation over an arbit...
Abstract: Several methods for updating the ghost cell regions of large, distributed arrays are descr...
Abstract For the purpose of efficiently supporting parallel mesh-based simulations, we developed a p...
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount...
The efficient solution of many large-scale scientific calculations depends on unstructured mesh stra...
ISBN 978-84-942844-7-2International audienceThis paper presents a parallel remeshing algorithm for d...
In parallel computing environments from multicore systems to cloud computers and supercomputers, dat...
Anisotropic mesh adaptation is a powerful way to directly minimise the computational cost of mesh ba...
Irregular problems require the computation of some properties for a set of elements that are irregul...
Distributing discrete event simulations among several processors appears to be a promising approach ...
AbstractThis paper addresses two key parallelization challenges the unstructured mesh-based ocean mo...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
Parallelizing large sized problem in parallel systems has always been a challenge for programmer. Th...
We discuss parallel algorithms to compute the ghost layer in computational, distributed memory, recu...
There are numerous scientific applications which require large and complex meshes. Given the explos...
Graph partitioning has been shown to be an effective way to divide a large computation over an arbit...
Abstract: Several methods for updating the ghost cell regions of large, distributed arrays are descr...
Abstract For the purpose of efficiently supporting parallel mesh-based simulations, we developed a p...
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount...
The efficient solution of many large-scale scientific calculations depends on unstructured mesh stra...
ISBN 978-84-942844-7-2International audienceThis paper presents a parallel remeshing algorithm for d...
In parallel computing environments from multicore systems to cloud computers and supercomputers, dat...
Anisotropic mesh adaptation is a powerful way to directly minimise the computational cost of mesh ba...
Irregular problems require the computation of some properties for a set of elements that are irregul...
Distributing discrete event simulations among several processors appears to be a promising approach ...
AbstractThis paper addresses two key parallelization challenges the unstructured mesh-based ocean mo...
There are numerous large-scale applications requiring mesh adaptivity, e.g., computational fluid dyn...
Parallelizing large sized problem in parallel systems has always been a challenge for programmer. Th...