From: Martin Kronbichler Date: Fri, 7 Jun 2019 13:18:19 +0000 (+0200) Subject: Fix two more inaccuracies X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=a446c1652350a7a714968106765188421a532b7f;p=release-papers.git Fix two more inaccuracies --- diff --git a/9.1/paper.tex b/9.1/paper.tex index bc60865..3fb6cd5 100644 --- a/9.1/paper.tex +++ b/9.1/paper.tex @@ -591,7 +591,7 @@ supercomputer in Garching, Germany. Scaling tests have been performed on up to the full machine with 304,128 cores of the Intel Xeon Skylake architecture and an arithmetic performance of around 5 PFlop/s for a geometric multigrid solver with polynomials of degree 4 has been reached. Compared to the official -LINPACK performance of the machine of 19.5 PFlop (the machine is listed on +LINPACK performance of the machine of 19.5 PFlop/s (the machine is listed on position 8 of the top-500 list of November 2018), this can be considered an extremely good value for a PDE solver which have classically only reached a few percent of the LINPACK performance, and given the optimization steps @@ -601,7 +601,7 @@ largest Poisson problem that has been solved on 304k cores contained 2.15 trillion unknowns (or 7.1 million unknowns per MPI rank) and was solved in 3.5 seconds. Also, CFD production runs with up to $10^{11}$ unknowns and $10^5$ time steps have been completed in less than seven hours, demonstrating the -capabilities of \dealii for large-scale parallel computations. The tests +capabilities of \dealii for large-scale parallel computations. The scaling tests also revealed several relatively expensive operations in the setup of the multigrid unknowns in \dealii's \texttt{DoFHandler} and \texttt{MGTransfer} classes. While a few bottlenecks have already been resolved, we plan several