2,618 Hits in 5.6 sec

Dynamic Load Balancing for Unstructured Meshes on Space-Filling Curves

Daniel F. Harlacher, Harald Klimach, Sabine Roller, Christian Siebert, Felix Wolf
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum  
On such architectures, space-filling curves (SFCs) offer a memory-efficient alternative and many sophisticated schemes have already been proposed.  ...  Load imbalance is an important impediment on the path towards higher degrees of parallelism-especially for engineering codes with their highly unstructured problem domains.  ...  ACKNOWLEDGMENT The authors would like to thank the Gauss Centre for Supercomputing (GCS) which provided us with the necessary resources on different HPC systems.  ... 
doi:10.1109/ipdpsw.2012.207 dblp:conf/ipps/HarlacherKRSW12 fatcat:cdi6lz5ygvhjzowt5szfkc5mja

Parallel Multigrid on Cartesian Meshes with Complex Geometry [chapter]

Marsha Berger, Michael Aftosmis, Gedas Adomavicius
2001 Parallel Computational Fluid Dynamics 2000  
We show that an on-the-fly space-filling curve approach leads to locally balanced partitions and to an effective multigrid coarsening algorithm.  ...  Significant issues include domain partitioning for parallel computation and mesh coarsening for multigrid.  ...  ACKNOWLEDGMENTS The authors would like to thank Scott Baden and Rainold Löhner for introducing them to some uses of space-filling curves.  ... 
doi:10.1016/b978-044450673-3/50103-2 fatcat:6sfkemfbbzfktafcxkvu24mfaa

A common data management infrastructure for adaptive algorithms for PDE solutions

Manish Parashar, James C. Browne, Carter Edwards, Kenneth Klimkowski
1997 Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '97  
This paper is primarily concerned with the two lowest layersof this infrastructure: a layer which defines and implements dynamic distributed arrays (DDA), and a layer in which several dynamic data and  ...  Implementation of sample applications based on each of these methods are described and implementation issues and performance measurements are presented.  ...  An efficient family of such maps are defined by space-filling curves (SFC) [3] . One such mapping is defined by the Hilbert space-filling curve, illustrated in Figure 3 .2.  ... 
doi:10.1145/509593.509649 dblp:conf/sc/ParasharBEK97 fatcat:277ki7fg5fdclcpxiygdnc4q6y

Towards autonomic application-sensitive partitioning for SAMR applications

Sumir Chandra, Manish Parashar
2005 Journal of Parallel and Distributed Computing  
Distributed structured adaptive mesh refinement (SAMR) techniques offer the potential for accurate and cost-effective solutions of physically realistic models of complex physical phenomena.  ...  However, the phenomena being modeled by these applications and their implementations are inherently multi-phased, dynamic, and heterogeneous in time, space, and state.  ...  The authors are grateful to Ravi Samtaney and Mijan Huq for making the applications available for use.  ... 
doi:10.1016/j.jpdc.2004.09.020 fatcat:mvold76gafggnocips4kae4v5m

Zoltan data management services for parallel dynamic applications

K. Devine, E. Boman, R. Heaphy, B. Hendrickson, C. Vaughan
2002 Computing in science & engineering (Print)  
Acknowledgments We thank Steve Attaway, Carter Edwards, Robert Leland, Ali Pinar, Steve Plimpton, Alex Pothan, Robert Preis, and John Shadid for their discussions, ideas, and color figures.  ...  RCB assigns parent and child elements to the same processor, preventing the need for communication between mesh levels. S C I E N T I F I C P R O G R A M M I N G Space-filling curves (SFC).  ...  For example, Figure 1 shows how Zoltan's callback function interface works for performing dynamic load balancing in an application.  ... 
doi:10.1109/5992.988653 fatcat:kxzx45izwfaw7pklijwapl22a4

Design of dynamic load-balancing tools for parallel applications

Karen Devine, Bruce Hendrickson, Erik Boman, Matthew St. John, Courtenay Vaughan
2000 Proceedings of the 14th international conference on Supercomputing - ICS '00  
Recursive inertial bisection [20] , space-filling curves [6, 22] : and additional tree-based p&titioning algorithms [12] are currently being added to Zokan.  ...  A typical interaction between ~application and the dynamic load-balancing tools is shown in Figure I.i For this example, the nodes of a tinite element mesh are the objects to be balanced by ZAan.  ...  The cost of load balancing and data migration in this experiment was less than 2% of the ' original matrix fill time. The time to compute the new decomposition was 0.28 seconds.  ... 
doi:10.1145/335231.335242 dblp:conf/ics/DevineHBJV00 fatcat:rgtlcbqf5nhfvjd2tkp54mngfy

JAUMIN: a programming framework for large-scale numerical simulation on unstructured meshes

Qingkai Liu, Zeyao Mo, Aiqing Zhang, Zhang Yang
2019 CCF Transactions on High Performance Computing  
This paper introduces a programming framework named JAUMIN for large-scale numerical applications on unstructured meshes.  ...  Based on this framework, serial codes are only required to be written for large-scale parallel application suitable for modern supercomputers with tens of thousands of CPU cores.  ...  Load repartition JAUMIN integrates several widely used load repartition methods, such as geometrical bisection methods, space filling curves and greedy methods.  ... 
doi:10.1007/s42514-019-00001-z fatcat:eqsqtsicp5efranlodrempqxdu

Performance of a new CFD flow solver using a hybrid programming paradigm

M.J. Berger, M.J. Aftosmis, D.D. Marshall, S.M. Murman
2005 Journal of Parallel and Distributed Computing  
This paper presents several algorithmic innovations and a hybrid programming style that lead to highly scalable performance using shared memory for a new computational fluid dynamics flow solver.  ...  This hybrid model is then converted to a strict message-passing implementation, and performance results for the two are compared.  ...  Obviously the space-filling curve load balancing algorithm is doing a good job of partitioning the work to obtain this degree of scalability.  ... 
doi:10.1016/j.jpdc.2004.11.010 fatcat:3u3mefetuzgihc5f573ywbcm7e

Applying Convolutional Neural Networks to Data on Unstructured Meshes with Space-Filling Curves [article]

Claire E. Heaney, Yuling Li, Omar K. Matar, Christopher C. Pain
2021 arXiv   pre-print
The space-filling curves (SFCs) are used to find an ordering of the nodes or cells that can transform multi-dimensional solutions on unstructured meshes into a one-dimensional (1D) representation, to which  ...  Central to the approach are space-filling curves, which traverse the nodes or cells of a mesh tracing out a path that is as short as possible (in terms of numbers of edges) and that visits each node or  ...  Determining Space-Filling Curves on Unstructured Meshes This section describes how to generate space-filling curves for unstructured meshes.  ... 
arXiv:2011.14820v2 fatcat:7gwys4cvvfbjnp5eu4xqfd6ilu

Parallelisation of Multiscale-Based Grid Adaptation using Space-Filling Curves

Kolja Brix, Silvia Sorana Melian, Siegfried Müller, Gero Schieffer, F. Coquel, Y. Maday, S. Müller, M. Postel, Q.H. Tran
2009 ESAIM: Proceedings and Surveys  
This has been realised using space-filling curves.  ...  In view of a proper scaling of the computational performance with respect to CPU time and memory, the load of data has to be well-balanced and communication between processors has to be minimised.  ...  Load-Balancing via Space-Filling Curves When it comes to parallelisation, we have to take into account the mesh partitioning or the load-balancing problem.  ... 
doi:10.1051/proc/2009058 fatcat:vk7nky2s6ve2pn2t7f6rbk6nuq

Hybrid Parallelization of Euler-Lagrange Simulations Based on MPI-3 Shared Memory [article]

Patrick Kopper, Stephen Copplestone, Marcel Pfeiffer, Christian Koch, Stefanos Fasoulas, Andrea Beck
2022 arXiv   pre-print
One of the most prominent slowdowns is the search for halo elements in physical space for the purpose of runtime communication avoidance.  ...  The use of Euler-Lagrange methods on unstructured grids extends their application area to more versatile setups.  ...  We acknowledge PRACE for awarding us access to hawk at GCS@HLRS, Germany.  ... 
arXiv:2203.13840v1 fatcat:7hjioyc4fngalnct5xiqz52tz4

Extreme-Scale AMR

Carsten Burstedde, Omar Ghattas, Michael Gurnis, Tobin Isaac, Georg Stadler, Tim Warburton, Lucas Wilcox
2010 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis  
Due to the complex dynamic data structures and frequent load balancing, scaling dynamic AMR to hundreds of thousands of cores has long been considered a challenge.  ...  One approach to overcoming the tyranny of scales is adaptive mesh refinement/coarsening (AMR), which dynamically adapts the mesh to resolve features of interest.  ...  We also thank TACC for providing access to Ranger under TeraGrid award MCA04N026, and the NCCS/ORNL for early-user access to Jaguar.  ... 
doi:10.1109/sc.2010.25 dblp:conf/sc/BursteddeGGISWW10 fatcat:j2igjrbui5hf3a4rgeki73ltva

Parallel anisotropic 3D mesh adaptation by mesh modification

Frédéric Alauzet, Xiangrong Li, E. Seegyoung Seol, Mark S. Shephard
2006 Engineering with Computers  
The resulting procedures are demonstrated on general curved 3D domains where the anisotropic mesh size field is defined by either an analytic expression or by an adaptive correction indicator as part of  ...  The first improvement focuses on control of the local operations that modify the mesh to satisfy the given anisotropic mesh metric field.  ...  mesh entities between the partitions and the dynamic mesh load balancing.  ... 
doi:10.1007/s00366-005-0009-3 fatcat:hvd6x3f36vdodojgzhsr7bvv74

Parallel SFC-based mesh partitioning and load balancing [article]

Ricard Borrell, Guillermo Oyarzun, Damien Dosimont, Guillaume Houzeaux
2020 arXiv   pre-print
In this paper, we focus on mesh partitioning. In particular, we present some improvements carried out on an in-house parallel mesh partitioner based on the Hilbert Space-Filling Curve.  ...  Additionally, taking advantage of its performance, we present the application of the SFC-based partitioning for dynamic load balancing.  ...  The computing experiments of this paper have been performed on the resources of the Barcelona Supercomputing Center. .  ... 
arXiv:2007.03518v1 fatcat:ep55xldlnrbmxmfrrjeirdf3om

Adaptive Multiresolution Methods: Practical issues on Data Structures, Implementation and Parallelization

K. Brix, S. Melian, S. Müller, M. Bachmann
2011 ESAIM: Proceedings and Surveys  
using global cell identifiers and the parallelization of the multiresolution-based grid adaptation via MPI using space-filling curves.  ...  The aim of the present work is to give a self-contained overview on the construction of an appropriate multiresolution analysis using biorthogonal wavelets, its efficient realization by means of hash maps  ...  To solve the load-balancing problem for unstructured triangular meshes, the Sierpiński space-filling curve can be used.  ... 
doi:10.1051/proc/201134003 fatcat:hmqenxkd3jbapm3m76jmxzkjq4
« Previous Showing results 1 — 15 out of 2,618 results