Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software

Authors:
Andriy Kot;Andrey Chernikov;Nikos Chrisochoides
Affiliations:
The College of William and Mary, Dept. of Computer Science, Williamsburg, VA;The College of William and Mary, Dept. of Computer Science, Williamsburg, VA;The College of William and Mary, Dept. of Computer Science, Williamsburg, VA
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 11
Cited 3

An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
The design and implementation of SOLAR, a portable library for scalable out-of-core linear algebra computations

Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
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
Hybrid technology multithreaded architecture

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Delaunay refinement mesh generation

Delaunay refinement mesh generation
A Load Balancing Framework for Adaptive and Asynchronous Applications

IEEE Transactions on Parallel and Distributed Systems
Practical and efficient point insertion scheduling method for parallel guaranteed quality delaunay refinement

Proceedings of the 18th annual international conference on Supercomputing
A Computational Database System for Generatinn Unstructured Hexahedral Meshes with Billions of Elements

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
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement

SIAM Journal on Scientific Computing

Algorithm 872: Parallel 2D constrained Delaunay mesh generation

ACM Transactions on Mathematical Software (TOMS)
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software

Journal of Experimental Algorithmics (JEA)
Morph algorithms on GPUs

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two cost-effective and high-performance out-of-core parallel mesh generation algorithms and their implementation on Cluster of Workstations (CoWs). The total wall-clock time including wait-in-queue delays for the out-of-core methods on a small cluster (16 processors) is three times shorter than the total wall-clock time for the incore generation of the same size mesh (about a billion elements) using 121 processors. Our best out-of-core method, for mesh sizes that fit completely in the core of the CoWs, is about 5% slower than its in-core parallel counterpart method. This is a modest performance penalty for savings of many hours in response time. Both the in-core and out-of-core methods use the best publicly available off-the-shelf sequential in-core Delaunay mesh generator.