From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Wed, 25 May 2022 23:59:12 +0000 (-0600)
Subject: Leave a note.
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=ab649409b9b25eff2ec97c8cbe38dfeba323d60a;p=release-papers.git

Leave a note.
---

diff --git a/9.4/paper.tex b/9.4/paper.tex
index 41e71fa..bd9e137 100644
--- a/9.4/paper.tex
+++ b/9.4/paper.tex
@@ -462,7 +462,8 @@ sent to the new owner. On the
 receiving side, the sets of all cells are combined and possible duplicates
 are removed. This information is enough to construct a new triangulation.
 For sending/receiving, we apply consensus-based algorithms~\cite{hoefler2010scalable}, which
-we introduced into the library in release 9.2~\cite{dealII92}. Consensus-based 
+we introduced into the library in release 9.2~\cite{dealII92} -- see
+also Section~\ref{sec:CA}. Consensus-based
 algorithms are used also in \cite{ibanez2016pumi} for repartitioning.
 
 In future releases, we plan to add support for repartitioning based on distributed graph
@@ -587,10 +588,13 @@ to \dealii in the future.
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \subsection{Improvements to unstructured communication}
+\label{sec:CA}
 
 \todo[inline]{Wolfgang to write something about the CA algorithms (and to give
 credit to the previous implementation by Peter).}
 
+Also reference Section~\ref{sec:repartitioning}.
+
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \subsection{Topic 7}