Skip to content

Commit bda2d31

Browse files
authored
Reduce dask.order overhead by removing stripped_dep computation (#9031)
1 parent c5ca1ff commit bda2d31

File tree

1 file changed

+1
-13
lines changed

1 file changed

+1
-13
lines changed

distributed/scheduler.py

Lines changed: 1 addition & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -4867,19 +4867,7 @@ async def update_graph(
48674867
dsk = _cull(dsk, keys)
48684868

48694869
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-
)
4870+
internal_priority = await offload(dask.order.order, dsk=dsk)
48834871
ordering_done = time()
48844872

48854873
logger.debug("Ordering done.")

0 commit comments

Comments
 (0)