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
In, for instance, the 3D Euler solvers, there are some work arrays whose size is hard-coded. It would be cleaner to size them at run-time, but currently this incurs a performance penalty; see discussion in #75. It seems that in some tests the dynamic allocation leads to a 6-7% slowdown. Once we switch to modules for Riemann solvers, we can size these at run time but still only allocate them once, as module data.
The text was updated successfully, but these errors were encountered:
In, for instance, the 3D Euler solvers, there are some work arrays whose size is hard-coded. It would be cleaner to size them at run-time, but currently this incurs a performance penalty; see discussion in #75. It seems that in some tests the dynamic allocation leads to a 6-7% slowdown. Once we switch to modules for Riemann solvers, we can size these at run time but still only allocate them once, as module data.
The text was updated successfully, but these errors were encountered: