Reshuffle
Adds a temporary random key to each element in a collection, reshuffles these keys, and removes the temporary key. This redistributes the elements between workers and returns a collection equivalent to its input collection. This is most useful for adjusting parallelism or preventing coupled failures.
Examples
See Issue 19498 for updates.
Related transforms
N/A
Last updated on 2024/11/20
Have you found everything you were looking for?
Was it all useful and clear? Is there anything that you would like to change? Let us know!