Replies: 1 comment 1 reply
-
I'll copy this question on Discourse asap. |
Beta Was this translation helpful? Give feedback.
1 reply
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
I am looking for a way to prioritize by partition/index order. My computation graph contains lots of backward-looking operations (ie: ffill, shift, etc) so there is no way partition
n+1
can finish before lower partitionn
. That's why prioritizing by partition order will allow me to get faster partial results and use less memory.Here a non-satisfactory pseudo-code:
Unfortunately:
dd.persist()
Beta Was this translation helpful? Give feedback.
All reactions