Download or read book Scalable Algorithms for Parallel Tree based Adaptive Mesh Refinement with General Element Types written by Johannes Holke and published by . This book was released on 2018 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parallel Algorithms for Adaptive Mesh Refinement written by and published by . This book was released on 1997 with total page 24 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientific calculations. The adaptive construction of such nonuniform meshes is an important part of these methods. In this paper, the authors present a parallel algorithm for adaptive mesh refinement that is suitable for implementation on distributed-memory parallel computers. Experimental results obtained on the Intel DELTA are presented to demonstrate that, for scientific computations involving the finite element method, the algorithm exhibits scalable performance and has a small run time in comparison with other aspects of the scientific computations examined. It is also shown that the algorithm has a fast expected running time under the P-RAM computation model.

Download or read book The Scalability of Parallel Adaptive Mesh Refinement with Uintah written by Justin Paul Luitjens and published by . This book was released on 2011 with total page 147 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book The Scalability of Mesh Improvement Algorithms written by Lori Freitag and published by . This book was released on 1997 with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper we develop a common framework to explore the scalability of three improvement strategies for unstructured meshes: adaptive refinement, vertex smoothing, and edge flipping. We give a general parallel algorithm for these strategies based on defining, for each algorithm, an elemental operation and a task graph. By choosing the correct task graph, we can ensure the correct parallel execution of the algorithms independent of implementation. Finally, we present experimental results obtained on an IBM SP system and use these results to investigate, in practice, the scaling and relative costs of these algorithms."

Download or read book Adaptive Mesh Refinement Algorithms for Parallel Unstructured Finite Element Codes written by J. M. Solberg and published by . This book was released on 2006 with total page 27 pages. Available in PDF, EPUB and Kindle. Book excerpt: This project produced algorithms for and software implementations of adaptive mesh refinement (AMR) methods for solving practical solid and thermal mechanics problems on multiprocessor parallel computers using unstructured finite element meshes. The overall goal is to provide computational solutions that are accurate to some prescribed tolerance, and adaptivity is the correct path toward this goal. These new tools will enable analysts to conduct more reliable simulations at reduced cost, both in terms of analyst and computer time. Previous academic research in the field of adaptive mesh refinement has produced a voluminous literature focused on error estimators and demonstration problems; relatively little progress has been made on producing efficient implementations suitable for large-scale problem solving on state-of-the-art computer systems. Research issues that were considered include: effective error estimators for nonlinear structural mechanics; local meshing at irregular geometric boundaries; and constructing efficient software for parallel computing environments.

Download or read book Towards Scalable Adaptive Mesh Refinement on Future Parallel Architectures written by David Alexander Beckingsale and published by . This book was released on 2015 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parallel Algorithms for the Adaptive Refinement and Partitioning of Unstructured Meshes written by and published by . This book was released on 1994 with total page 8 pages. Available in PDF, EPUB and Kindle. Book excerpt: The efficient solution of many large-scale scientific calculations depends on adaptive mesh strategies. In this paper we present new parallel algorithms to solve two significant problems that arise in this context: the generation of the adaptive mesh and the mesh partitioning. The crux of our refinement algorithm is the identification of independent sets of elements that can be refined in parallel. The objective of our partitioning heuristic is to construct partitions with good aspect rations. We present run-time bounds and computational results obtained on the Intel DELTA for these algorithms. These results demonstrate that the algorithms exhibit scalable performance and have run-times small in comparison with other aspects of the computation.

Download or read book Parallel Anisotropic Block based Adaptive Mesh Refinement Algorithm For Three dimensional Flows written by Michael Williamschen and published by . This book was released on 2013 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Block Based Adaptive Mesh Refinement Finite Volume Scheme for Hybrid Multi Block Meshes written by Jason Z. X. Zheng and published by . This book was released on 2012 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Adaptive Mesh Refinement Theory and Applications written by Tomasz Plewa and published by Springer Science & Business Media. This book was released on 2005-12-20 with total page 550 pages. Available in PDF, EPUB and Kindle. Book excerpt: Advanced numerical simulations that use adaptive mesh refinement (AMR) methods have now become routine in engineering and science. Originally developed for computational fluid dynamics applications these methods have propagated to fields as diverse as astrophysics, climate modeling, combustion, biophysics and many others. The underlying physical models and equations used in these disciplines are rather different, yet algorithmic and implementation issues facing practitioners are often remarkably similar. Unfortunately, there has been little effort to review the advances and outstanding issues of adaptive mesh refinement methods across such a variety of fields. This book attempts to bridge this gap. The book presents a collection of papers by experts in the field of AMR who analyze past advances in the field and evaluate the current state of adaptive mesh refinement methods in scientific computing.

Download or read book Scalable Algorithms for Delaunay Mesh Generation written by Andrew G. Slatton and published by . This book was released on 2014 with total page 93 pages. Available in PDF, EPUB and Kindle. Book excerpt: Most recently, we have developed a parallel algorithm for meshing smooth surfaces based on this localized refinement technique. The change from sequential to parallel required modifications to various parts of the algorithm and a method for finding sets of octree nodes that could be processed in parallel. We again prove termination and geometric and topological closeness of output to input.

Download or read book Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers written by and published by . This book was released on 1993 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt: A procedure to support parallel refinement and redistribution of two dimensional unstructured finite element meshes on distributed memory computers is presented. The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency information. Mesh refinement is done by employing links back to the geometric representation to place new nodes on the boundary of the domain directly on the curved geometry. The refined mesh is then redistributed by an iterative heuristic based on the Leiss/Reddy 9 load balancing criteria. A fast parallel tree edge-coloring algorithm is used to pair processors having adjacent partitions and forming a tree structure as a result of Leiss/Reddy load request criteria. Excess elements are iteratively migrated from heavily loaded to less loaded processors until load balancing is achieved. The system is implemented on a massively parallel MasPar MP-1 system with a SIMD style of computation and uses message passing primitives to migrate elements during the mesh redistribution phase. Performance results of the redistribution heuristics on various test meshes are given.

Download or read book A Parallel Adaptive Mesh Refinement Algorithm written by James J. Quirk and published by . This book was released on 1993 with total page 36 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parallel Adaptive Mesh Refinement Algorithms for Unstructured 2D Meshes written by Mustafa Keskin and published by . This book was released on 1994 with total page 58 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book PARAMESH A Parallel Adaptive Mesh Refinement Community Toolkit written by and published by . This book was released on 1999 with total page 42 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Adaptive Mesh Refinement for Distributed Parallel Architectures written by Daniel James Quinlan and published by . This book was released on 1993 with total page 276 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Advances in Patch Based Adaptive Mesh Refinement Scalability written by and published by . This book was released on 2015 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt: Patch-based structured adaptive mesh refinement (SAMR) is widely used for high-resolution simu- lations. Combined with modern supercomputers, it could provide simulations of unprecedented size and resolution. A persistent challenge for this com- bination has been managing dynamically adaptive meshes on more and more MPI tasks. The dis- tributed mesh management scheme in SAMRAI has made some progress SAMR scalability, but early al- gorithms still had trouble scaling past the regime of 105 MPI tasks. This work provides two critical SAMR regridding algorithms, which are integrated into that scheme to ensure efficiency of the whole. The clustering algorithm is an extension of the tile- clustering approach, making it more flexible and efficient in both clustering and parallelism. The partitioner is a new algorithm designed to prevent the network congestion experienced by its prede- cessor. We evaluated performance using weak- and strong-scaling benchmarks designed to be difficult for dynamic adaptivity. Results show good scaling on up to 1.5M cores and 2M MPI tasks. Detailed timing diagnostics suggest scaling would continue well past that.