The maximum discrete surface-to-volume ratio of space-filling curve partitions

06/24/2021
by   Maximilien Gadouleau, et al.
0

Space-filling curves (SFCs) are used in high performance computing to distribute a computational domain or its mesh, respectively, amongst different compute units, i.e. cores or nodes or accelerators. The part of the domain allocated to each compute unit is called a partition. Besides the balancing of the work, the communication cost to exchange data between units determines the quality of a chosen partition. This cost can be approximated by the surface-to-volume ratio of partitions: the volume represents the amount of local work, while the surface represents the amount of data to be transmitted. Empirical evidence suggests that space-filling curves yield advantageous surface-to-volume ratios. Formal proofs are available only for regular grids. We investigate the surface-to-volume ratio of space-filling curve partitions for adaptive grids and derive the maximum surface-to-volume ratio as a function of the number of cells in the partition. In order to prove our main theorem, we construct a new framework for the study of adaptive grids, notably introducing the concepts of a shape and of classified partitions. The new methodological framework yields insight about the SFC-induced partition character even if the grids refine rather aggressively in localised areas: it quantifies the obtained surface-to-volume ratio. This framework thus has the potential to guide the design of better load balancing algorithms on the long term.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2020

Space-filling Curves for High-performance Data Mining

Space-filling curves like the Hilbert-curve, Peano-curve and Z-order map...
research
06/20/2023

Visual Analysis of Large Multi-Field AMR Data on GPUs Using Interactive Volume Lines

To visually compare ensembles of volumes, dynamic volume lines (DVLs) re...
research
03/16/2018

Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm

We study the problem of decomposing a volume bounded by a smooth surface...
research
10/17/2017

Efficient Neighbor-Finding on Space-Filling Curves

Space-filling curves (SFC, also known as FASS-curves) are a useful tool ...
research
09/14/2020

Data-Driven Space-Filling Curves

We propose a data-driven space-filling curve method for 2D and 3D visual...
research
05/06/2019

Computation of Circular Area and Spherical Volume Invariants via Boundary Integrals

We show how to compute the circular area invariant of planar curves, and...
research
09/05/2018

Distributed-Memory Forest-of-Octrees Raycasting

We present an MPI-parallel algorithm for the in-situ visualization of co...

Please sign up or login with your details

Forgot password? Click here to reset