### Edge coloring in unstructured CFD codes

**2016-01-28**

1601.07613 | cs.DC

We propose a way of preventing race conditions in the evaluation of the
surface integral contribution in discontinuous Galerkin and finite volume flow
solvers by coloring the edges (or faces) of the computational mesh. In this
work we use a partitioning algorithm that separates the edges of triangular
elements into three groups and the faces of quadrangular and tetrahedral
elements into four groups; we then extend this partitioning to adaptively
refined, nonconforming meshes. We use the ascribed coloring to reduce code
memory requirements and optimize accessing the elemental data in memory. This
process reduces memory access latencies and speeds up computations on graphics
processing units.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2018-04-09**

1804.03245 | cs.NA

We introduce an integrated meshing and finite element method pipeline
enabling black-box solution of… show more

**2018-10-02**

1810.01175 | cs.GR

This tutorial describes the geometry and algorithms for generating line
drawings from 3D models, foc… show more

**2019-01-02**

1901.00479 | cs.DS

Vizing showed that it suffices to color the edges of a simple graph using
$\Delta + 1$ colors, where… show more

**2019-05-10**

1905.04033 | cs.NA

We propose a general algorithm for non-conforming adaptive mesh refinement
(AMR) of unstructured mes… show more

**2018-10-18**

1810.08004 | cs.CC

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced
in 1978, by Erd\"os, Si… show more

**2019-03-22**

1903.09332 | cs.NA

The Finite Element Method (FEM) is widely used to solve discrete Partial
Differential Equations (PDE… show more

**2019-02-12**

1902.04359 | math.CO

A graph is outer-1-planar if it can be drawn in the plane so that all
vertices are on the outer face… show more

**2019-03-26**

1903.11045 | math.NA

We propose a multilevel approach for trace systems resulting from hybridized
discontinuous Galerkin … show more

**2019-03-13**

1903.06043 | cs.DM

In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of
colors assigned to the … show more

**2018-05-22**

1805.08831 | cs.CG

This paper presents a new scalable parallelization scheme to generate the 3D
Delaunay triangulation … show more

**2019-04-20**

1904.09438 | cs.DS

Unigraphs are graphs uniquely determined by their own degree sequence up to
isomorphism. There are m… show more

**2018-11-22**

1811.09136 | cs.DS

Recently, considerable efforts have been devoted to approximately computing
the global and local (i.… show more

**2018-02-11**

1802.03749 | cs.MS

Unstructured-mesh based numerical algorithms such as finite volume and finite
element algorithms for… show more

**2018-01-07**

1801.02239 | cs.DS

In multi-channel Wireless Mesh Networks (WMN), each node is able to use
multiple non-overlapping fre… show more

**2018-08-21**

1808.07096 | cs.CV

Color separations (most often cyan, magenta, yellow, and black) are commonly
used in printing to rep… show more

**2018-09-07**

1809.02666 | cs.MS

Large-scale parallel numerical simulations are essential for a wide range of
engineering problems th… show more