-
Notifications
You must be signed in to change notification settings - Fork 6
Compare to euler_cuarray.jl? #4
Comments
That should be fine, since we need the GPU setup anyway. I think the best way forward is to not modify the code as is but to keep it frozen for comparisons and then add our rewrite in a separate file. |
We are in the process of creating a |
FYI: euler_cuarray.jl is our optimized version of the compressible Euler equations (2d and 3d) running on multi-cpu and multi-gpu. shallow_water.jl is only meant to show the MIT group what it would entail to write a simple shallow water solver using discontinuous Galerkin methods. As Lucas Wilcox said above, we are in the process of building a similarly optimized version of shallow_water.jl that will look a lot like euler_cuarray.jl. |
Thanks for chiming in! That must have been a miss-understanding on my part then. Just to make sure that we are working on the right goal here. We still want to speed up |
To clarify what @fxgiraldo said, you should be starting from the shallow water code. So We at NPS are just planning on getting you a code that you can do a direct, head to head comparison with for performance. |
Thanks @jkozdon - that is well said. |
Hi @vchuravy, Please let any of us know if you have any questions (@fxgiraldo, @lcw, @jkozdon ). Your code is looking pretty cool! |
Thanks! That is much appreciated, that will allow me to setup a benchmarking harness to compare performance |
If euler_cuarray.jl does the same thing as shallow_water.jl, lets make the comparison. If they are so different that it would be a lot of work to run euler_cuarray.jl, then we can skip it.
The text was updated successfully, but these errors were encountered: