Results 1 - 10 of 905

1 Scalable Algorithms for Distributed-Memory Adaptive Mesh Refinement

by Akhil Langer, Jonathan Liffl, Phil Miller, Kuo-chuan Pan, Laxmikant V. Kale, Paul Ricker
"... Abstract—This paper presents scalable algorithms and data structures for adaptive mesh refinement computations. We describe a novel mesh restructuring algorithm for adaptive mesh refinement computations that uses a constant number of collectives regardless of the refinement depth. To further increas ..."
Abstract - Add to MetaCart
Abstract—This paper presents scalable algorithms and data structures for adaptive mesh refinement computations. We describe a novel mesh restructuring algorithm for adaptive mesh refinement computations that uses a constant number of collectives regardless of the refinement depth. To further

Highly Asynchronous and Scalable Algorithms for Distributed-Memory Adaptive Mesh Refinement at Extreme Scales

by Akhil Langer, Laxmikant V. Kale
"... Abstract—In this paper, we present our developments of a novel approach for distributed memory Adaptive Mesh Refine-ment (AMR). Our approach is highly asynchronous and fully distributed that makes it suitable for extreme-level scaling. It takes negligible memory to store mesh structure as compared t ..."
Abstract - Add to MetaCart
Abstract—In this paper, we present our developments of a novel approach for distributed memory Adaptive Mesh Refine-ment (AMR). Our approach is highly asynchronous and fully distributed that makes it suitable for extreme-level scaling. It takes negligible memory to store mesh structure as compared

Parallel Algorithms For Adaptive Mesh Refinement

by Mark T. Jones, Paul E. Plassmann - SIAM JOURNAL ON SCIENTIFIC COMPUTING , 1997
"... 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, we present a p ..."
Abstract - Cited by 28 (6 self) - Add to MetaCart
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

The Scalability Of Mesh Improvement Algorithms

by Lori F. Freitag, Mark T. Jones, Paul E. Plassmann - IMA VOLUMES IN MATHEMATICS AND ITS APPLICATIONS , 1998
"... 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 ope ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
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

Interactive Multiresolution Mesh Editing

by Denis Zorin, Peter Schröder , Wim Sweldens
"... We describe a multiresolution representation for meshes based on subdivision. Subdivision is a natural extension of the existing patch-based surface representations. At the same time subdivision algorithms can be viewed as operating directly on polygonal meshes, which makes them a useful tool for me ..."
Abstract - Cited by 208 (18 self) - Add to MetaCart
local and adaptive, considerably improving their efficiency. We have built a scalable interactive multiresolution editing system based on such algorithms.

Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations

by Roy Williams - Concurrency , 1991
"... If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributed-memory parallel processor, but if the mesh is unstructured, the problem becomes much more difficult. The distribution should be made so that ..."
Abstract - Cited by 175 (3 self) - Add to MetaCart
If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributed-memory parallel processor, but if the mesh is unstructured, the problem becomes much more difficult. The distribution should be made so

Mesh adaptive direct search algorithms for constrained optimization

by Charles Audet, J. E. Dennis, Jr. - SIAM J. OPTIM , 2004
"... This paper introduces the Mesh Adaptive Direct Search (MADS) class of algorithms for nonlinear optimization. MADS extends the Generalized Pattern Search (GPS) class by allowing local exploration, called polling, in a dense set of directions in the space of optimization variables. This means that u ..."
Abstract - Cited by 146 (15 self) - Add to MetaCart
This paper introduces the Mesh Adaptive Direct Search (MADS) class of algorithms for nonlinear optimization. MADS extends the Generalized Pattern Search (GPS) class by allowing local exploration, called polling, in a dense set of directions in the space of optimization variables. This means

Global Load balancing with Parallel Mesh Adaption on Distributed-Memory Systems

by Rupak Biswas, Leonid Oliker, Andrew Sohn - PROC. SUPERCOMPUTING'96 , 1996
"... Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortu-nately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral me ..."
Abstract - Cited by 11 (7 self) - Add to MetaCart
mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is pre-sented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption

Adaptive Data Placement for Distributed-Memory Machines

by David K. Lowenthal, Gregory R. Andrews - UNIVERSITY OF ARIZONA , 1995
"... Programming distributed-memory machines requires paying careful attention to where the data is placed. This is because for efficiency, it is important to balance the computational load among the nodes and to minimize excess movement of data between the nodes during the computation. Most current appr ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Programming distributed-memory machines requires paying careful attention to where the data is placed. This is because for efficiency, it is important to balance the computational load among the nodes and to minimize excess movement of data between the nodes during the computation. Most current

Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers

by C. Özturan, H. L. deCougny, M. S. Shephard, J. E. Flaherty - Comput. Methods Appl. Mech. Engrg , 1993
"... 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 inform ..."
Abstract - Cited by 17 (1 self) - Add to MetaCart
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
Results 1 - 10 of 905