A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains
Proceedings of the eighteenth annual symposium on Computational geometry
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
A Load Balancing Framework for Adaptive and Asynchronous Applications
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 18th annual international conference on Supercomputing
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Flow Past a Stationary and Moving Cylinder: DNS at Re=10,000
DOD_UGC '04 Proceedings of the 2004 Users Group Conference
Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space
ACM Transactions on Mathematical Software (TOMS)
Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
Three-dimensional delaunay refinement for multi-core processors
Proceedings of the 22nd annual international conference on Supercomputing
Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
SIAM Journal on Scientific Computing
Generalized Two-Dimensional Delaunay Mesh Refinement
SIAM Journal on Scientific Computing
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
SIAM Journal on Scientific Computing
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We present three related out-of-core parallel mesh generation algorithms and their implementations for small size computational clusters. Computing out-of-core permits to solve larger problems than otherwise possible on the same hardware setup. Also, when using shared computing resources with high demand, a problem can take longer to compute in terms of wall-clock time when using an in-core algorithm on many nodes instead of using an out-of-core algorithm on few nodes. The difference is due to wait-in-queue delays that can grow exponentially to the number of requested nodes. In one specific case, using our best method and only 16 nodes it can take several times less wall-clock time to generate a 2 billion element mesh than to generate the same size mesh in-core with 121 nodes. Although our best out-of-core method exhibits unavoidable overheads (could be as low as 19% in some cases) over the corresponding in-core method (for mesh sizes that fit completely in-core), this is a modest and expected performance penalty. We evaluated our methods on traditional clusters of workstations as well as presented preliminary performance evaluation on emerging BlueWaters supercomputer.