Source code for distributed.active_memory_manager

from __future__ import annotations

from collections import defaultdict
from import Generator
from typing import TYPE_CHECKING

from tornado.ioloop import PeriodicCallback

import dask
from dask.utils import parse_timedelta

from .core import Status
from .metrics import time
from .utils import import_term, log_errors

if TYPE_CHECKING:  # pragma: nocover
    from .client import Client
    from .scheduler import Scheduler, TaskState, WorkerState

[docs]class ActiveMemoryManagerExtension: """Scheduler extension that optimizes memory usage across the cluster. It can be either triggered by hand or automatically every few seconds; at every iteration it performs one or both of the following: - create new replicas of in-memory tasks - destroy replicas of in-memory tasks; this never destroys the last available copy. There are no 'move' operations. A move is performed in two passes: first you create a copy and, in the next iteration, you delete the original (if the copy succeeded). This extension is configured by the dask config section ````. """ scheduler: Scheduler policies: set[ActiveMemoryManagerPolicy] interval: float # These attributes only exist within the scope of # Current memory (in bytes) allocated on each worker, plus/minus pending actions workers_memory: dict[WorkerState, int] # Pending replications and deletions for each task pending: defaultdict[TaskState, tuple[set[WorkerState], set[WorkerState]]] def __init__( self, scheduler: Scheduler, # The following parameters are exposed so that one may create, run, and throw # away on the fly a specialized manager, separate from the main one. policies: set[ActiveMemoryManagerPolicy] | None = None, register: bool = True, start: bool | None = None, interval: float | None = None, ): self.scheduler = scheduler self.policies = set() if policies is None: # Initialize policies from config policies = set() for kwargs in dask.config.get( "" ): kwargs = kwargs.copy() cls = import_term(kwargs.pop("class")) policies.add(cls(**kwargs)) for policy in policies: self.add_policy(policy) if register: scheduler.extensions["amm"] = self scheduler.handlers["amm_handler"] = self.amm_handler if interval is None: interval = parse_timedelta( dask.config.get("") ) self.interval = interval if start is None: start = dask.config.get("") if start: self.start()
[docs] def amm_handler(self, comm, method: str): """Scheduler handler, invoked from the Client by :class:`~distributed.active_memory_manager.AMMClientProxy` """ assert method in {"start", "stop", "run_once", "running"} out = getattr(self, method) return out() if callable(out) else out
[docs] def start(self) -> None: """Start executing every ``self.interval`` seconds until scheduler shutdown""" if self.running: return pc = PeriodicCallback(self.run_once, self.interval * 1000.0) self.scheduler.periodic_callbacks[f"amm-{id(self)}"] = pc pc.start()
[docs] def stop(self) -> None: """Stop periodic execution""" pc = self.scheduler.periodic_callbacks.pop(f"amm-{id(self)}", None) if pc: pc.stop()
@property def running(self) -> bool: """Return True if the AMM is being triggered periodically; False otherwise""" return f"amm-{id(self)}" in self.scheduler.periodic_callbacks def add_policy(self, policy: ActiveMemoryManagerPolicy) -> None: if not isinstance(policy, ActiveMemoryManagerPolicy): raise TypeError(f"Expected ActiveMemoryManagerPolicy; got {policy!r}") self.policies.add(policy) policy.manager = self
[docs] def run_once(self) -> None: """Run all policies once and asynchronously (fire and forget) enact their recommendations to replicate/drop keys """ with log_errors(): # This should never fail since this is a synchronous method assert not hasattr(self, "pending") self.pending = defaultdict(lambda: (set(), set())) self.workers_memory = { w: w.memory.optimistic for w in self.scheduler.workers.values() } try: # populate self.pending self._run_policies() drop_by_worker: ( defaultdict[WorkerState, set[TaskState]] ) = defaultdict(set) repl_by_worker: ( defaultdict[WorkerState, dict[TaskState, set[str]]] ) = defaultdict(dict) for ts, (pending_repl, pending_drop) in self.pending.items(): if not ts.who_has: continue who_has = {ws_snd.address for ws_snd in ts.who_has - pending_drop} assert who_has # Never drop the last replica for ws_rec in pending_repl: assert ws_rec not in ts.who_has repl_by_worker[ws_rec][ts] = who_has for ws in pending_drop: assert ws in ts.who_has drop_by_worker[ws].add(ts) # Fire-and-forget enact recommendations from policies stimulus_id = str(time()) for ws_rec, ts_to_who_has in repl_by_worker.items(): self.scheduler.stream_comms[ws_rec.address].send( { "op": "acquire-replicas", "keys": [ts.key for ts in ts_to_who_has], "stimulus_id": "acquire-replicas-" + stimulus_id, "priorities": {ts.key: ts.priority for ts in ts_to_who_has}, "who_has": {ts.key: v for ts, v in ts_to_who_has.items()}, }, ) for ws, tss in drop_by_worker.items(): # The scheduler immediately forgets about the replica and suggests # the worker to drop it. The worker may refuse, at which point it # will send back an add-keys message to reinstate it. for ts in tss: self.scheduler.remove_replica(ts, ws) self.scheduler.stream_comms[ws.address].send( { "op": "remove-replicas", "keys": [ts.key for ts in tss], "stimulus_id": "remove-replicas-" + stimulus_id, } ) finally: del self.workers_memory del self.pending
def _run_policies(self) -> None: """Sequentially run for all registered policies, obtain replicate/drop suggestions, and use them to populate self.pending. """ candidates: set[WorkerState] | None cmd: str ws: WorkerState | None ts: TaskState nreplicas: int for policy in list(self.policies): # a policy may remove itself policy_gen = ws = None while True: try: cmd, ts, candidates = policy_gen.send(ws) except StopIteration: break # next policy pending_repl, pending_drop = self.pending[ts] if cmd == "replicate": ws = self._find_recipient(ts, candidates, pending_repl) if ws: pending_repl.add(ws) self.workers_memory[ws] += ts.nbytes elif cmd == "drop": ws = self._find_dropper(ts, candidates, pending_drop) if ws: pending_drop.add(ws) self.workers_memory[ws] = max( 0, self.workers_memory[ws] - ts.nbytes ) else: raise ValueError(f"Unknown command: {cmd}") # pragma: nocover def _find_recipient( self, ts: TaskState, candidates: set[WorkerState] | None, pending_repl: set[WorkerState], ) -> WorkerState | None: """Choose a worker to acquire a new replica of an in-memory task among a set of candidates. If candidates is None, default to all workers in the cluster. Regardless, workers that either already hold a replica or are scheduled to receive one at the end of this AMM iteration are not considered. Returns ------- The worker with the lowest memory usage (downstream of pending replications and drops), or None if no eligible candidates are available. """ if ts.state != "memory": return None if candidates is None: candidates = self.scheduler.running.copy() else: candidates &= self.scheduler.running candidates -= ts.who_has candidates -= pending_repl if not candidates: return None # Select candidate with the lowest memory usage return min(candidates, key=self.workers_memory.__getitem__) def _find_dropper( self, ts: TaskState, candidates: set[WorkerState] | None, pending_drop: set[WorkerState], ) -> WorkerState | None: """Choose a worker to drop its replica of an in-memory task among a set of candidates. If candidates is None, default to all workers in the cluster. Regardless, workers that either do not hold a replica or are already scheduled to drop theirs at the end of this AMM iteration are not considered. This method also ensures that a key will not lose its last replica. Returns ------- The worker with the highest memory usage (downstream of pending replications and drops), or None if no eligible candidates are available. """ if len(ts.who_has) - len(pending_drop) < 2: return None if candidates is None: candidates = ts.who_has.copy() else: candidates &= ts.who_has candidates -= pending_drop candidates -= {waiter_ts.processing_on for waiter_ts in ts.waiters} if not candidates: return None # Select candidate with the highest memory usage. # Drop from workers with status paused or closing_gracefully first. return max( candidates, key=lambda ws: (ws.status != Status.running, self.workers_memory[ws]), )
[docs]class ActiveMemoryManagerPolicy: """Abstract parent class""" manager: ActiveMemoryManagerExtension def __repr__(self) -> str: return f"{self.__class__.__name__}()"
[docs] def run( self, ) -> Generator[ tuple[str, TaskState, set[WorkerState] | None], WorkerState | None, None, ]: """This method is invoked by the ActiveMemoryManager every few seconds, or whenever the user invokes ``client.amm.run_once``. It is an iterator that must emit any of the following: - "replicate", <TaskState>, None - "replicate", <TaskState>, {subset of potential workers to replicate to} - "drop", <TaskState>, None - "drop", <TaskState>, {subset of potential workers to drop from} Each element yielded indicates the desire to create or destroy a single replica of a key. If a subset of workers is not provided, it defaults to all workers on the cluster. Either the ActiveMemoryManager or the Worker may later decide to disregard the request, e.g. because it would delete the last copy of a key or because the key is currently needed on that worker. You may optionally retrieve which worker it was decided the key will be replicated to or dropped from, as follows: .. code-block:: python choice = (yield "replicate", ts, None) ``choice`` is either a WorkerState or None; the latter is returned if the ActiveMemoryManager chose to disregard the request. The current pending (accepted) commands can be inspected on ``self.manager.pending``; this includes the commands previously yielded by this same method. The current memory usage on each worker, *downstream of all pending commands*, can be inspected on ``self.manager.workers_memory``. """ raise NotImplementedError("Virtual method") # pragma: nocover
[docs]class AMMClientProxy: """Convenience accessors to operate the AMM from the dask client Usage: ``client.amm.start()`` etc. All methods are asynchronous if the client is asynchronous and synchronous if the client is synchronous. """ _client: Client def __init__(self, client: Client): self._client = client def _run(self, method: str): """Remotely invoke ActiveMemoryManagerExtension.amm_handler""" return self._client.sync(self._client.scheduler.amm_handler, method=method)
[docs] def start(self): return self._run("start")
[docs] def stop(self): return self._run("stop")
[docs] def run_once(self): return self._run("run_once")
[docs] def running(self): return self._run("running")
[docs]class ReduceReplicas(ActiveMemoryManagerPolicy): """Make sure that in-memory tasks are not replicated on more workers than desired; drop the excess replicas. """ def run(self): for ts in self.manager.scheduler.replicated_tasks: desired_replicas = 1 # TODO have a marker on TaskState # If a dependent task has not been assigned to a worker yet, err on the side # of caution and preserve an additional replica for it. # However, if two dependent tasks have been already assigned to the same # worker, don't double count them. nwaiters = len({waiter.processing_on or waiter for waiter in ts.waiters}) ndrop = len(ts.who_has) - max(desired_replicas, nwaiters) if ts in self.manager.pending: pending_repl, pending_drop = self.manager.pending[ts] ndrop += len(pending_repl) - len(pending_drop) # ndrop could be negative, which for range() is the same as 0. for _ in range(ndrop): yield "drop", ts, None