We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c5ca1ff commit bda2d31Copy full SHA for bda2d31
distributed/scheduler.py
@@ -4867,19 +4867,7 @@ async def update_graph(
4867
dsk = _cull(dsk, keys)
4868
4869
if not internal_priority:
4870
- # Removing all non-local keys before calling order()
4871
- dsk_keys = set(
4872
- dsk
4873
- ) # intersection() of sets is much faster than dict_keys
4874
- stripped_deps = {
4875
- k: v.intersection(dsk_keys)
4876
- for k, v in dependencies.items()
4877
- if k in dsk_keys
4878
- }
4879
-
4880
- internal_priority = await offload(
4881
- dask.order.order, dsk=dsk, dependencies=stripped_deps
4882
- )
+ internal_priority = await offload(dask.order.order, dsk=dsk)
4883
ordering_done = time()
4884
4885
logger.debug("Ordering done.")
0 commit comments