You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/documentation/expectedPerformance.md
+10-9Lines changed: 10 additions & 9 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -5,21 +5,22 @@ This page shows a summary of these results.
5
5
6
6
## Expected time-steps/hour
7
7
8
-
The following table outlines observed performance as nanoseconds per grid point (ns/GP) per right-hand side evaluation (lower is better).
8
+
The following table outlines observed performance as nanoseconds per grid point (ns/GP) per equation (eq) per right-hand side (rhs) evaluation (lower is better).
9
9
We solve an example 3D, inviscid, 5-equation model problem with two advected species (a total of 8 PDEs).
10
10
The numerics are WENO5 and the HLLC approximate Riemann solver.
11
+
This case is located in `examples/3D_performance_test`.
11
12
We report results for various numbers of grid points per CPU die (or GPU device) and hardware.
| Intel Xeon Gold 6226 | 12 cores |245|211|211| GNU 10.3.0 | PACE Phoenix |
21
+
| Apple M2 | 6 cores |365|306|563| GNU 13.2.0 | N/A |
22
+
23
+
__All results are in nanoseconds (ns) per grid point (gp) per equation (eq) per right-hand side (rhs) evaluation, so X ns/gp/eq/rhs. Lower is better.__
0 commit comments