scatter, is that right?
solveoperation across the last 2 dimensions, i.e. given
BI want to do
C[i,:,:]=solve(A[i,:,:], B[i,:,:])for all i in the leading dimension... I tried the below but it seems to be really slow (slower than numpy) - does anyone know what I'm doing wrong/what I could do better? Sorry if this was the wrong place to ask.
C = da.apply_gufunc(np.linalg.solve, "(i,j),(i,k)->(j,k)", A, B, vectorize=True,output_dtypes=A.dtype)
scaleand then read it back then scale up/down from that?
@mrocklin Do you think a maximum limit of workers which can be used by a submitted job would be useful, Although I see that we already have a param for providing a set of workers.
On a broader idea worker pools, something like this could be rather useful.
Can these two behaviours be achieved currently?
map_blocksassumes that I'm mapping an array on to another array, which doesn't match these use cases well