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
At the moment the shift compensation in ApplyMasksUDF can be a lot slower than the uncompensated one. When testing with the Radial Fourier example notebook and sparse masks, it was a bout a factor 25 slower. Dense masks will lead to an out of memory error there.
With optimized kernels that apply shifts to index calculations instead of slicing data, better performance should be achievable. Perhaps only a factor 3 slower?
The text was updated successfully, but these errors were encountered:
At the moment the shift compensation in
ApplyMasksUDF
can be a lot slower than the uncompensated one. When testing with the Radial Fourier example notebook and sparse masks, it was a bout a factor 25 slower. Dense masks will lead to an out of memory error there.With optimized kernels that apply shifts to index calculations instead of slicing data, better performance should be achievable. Perhaps only a factor 3 slower?
The text was updated successfully, but these errors were encountered: