dynamo-kv-router 1.3.0

KV Router - Radix tree for LLM KV cache routing
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
// SPDX-FileCopyrightText: Copyright (c) 2024-2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
// SPDX-License-Identifier: Apache-2.0

use std::{
    collections::{BTreeMap, BTreeSet},
    sync::{
        Arc, Mutex,
        atomic::{AtomicU64, AtomicUsize},
    },
    thread::JoinHandle,
};

use async_trait::async_trait;
use dashmap::DashMap;
use rustc_hash::FxBuildHasher;
use tokio::sync::oneshot;

use super::{
    KvIndexerInterface, KvIndexerMetrics, KvRouterError, ShardSizeSnapshot, SyncIndexer,
    WorkerLookupStats, WorkerTask, panic_payload_message,
};
use crate::indexer::pruning::{BlockEntry, PruneConfig, WorkerPruneManager};
use crate::protocols::*;
use dynamo_tokens::SequenceHash;

/// Generic wrapper that provides [`KvIndexerInterface`] for any [`SyncIndexer`] backend.
///
/// Spawns N OS threads for processing write events (sticky-routed by WorkerId).
/// Read operations (find_matches) are executed inline on the caller's thread,
/// avoiding channel overhead and allowing reads to scale with callers.
///
/// # Architecture
///
/// ```text
///                                       +------------------------------------+
///                                       |     N Worker Threads (OS threads)  |
///                                       |                                    |
///  worker_event_channels[0] ----------> |   Thread 0: blocking recv loop     |
///  worker_event_channels[1] ----------> |   Thread 1: blocking recv loop     |
///  worker_event_channels[N] ----------> |   Thread N: blocking recv loop     |
///                                       |                                    |
///  find_matches() ---(inline)---------> |   Arc<T: SyncIndexer>              |
///                                       |   (shared, thread-safe)            |
///                                       +------------------------------------+
/// ```
pub struct ThreadPoolIndexer<T: SyncIndexer> {
    /// Shared backend - thread-safe via internal locking.
    backend: Arc<T>,

    /// Maps WorkerId to worker thread index for sticky routing.
    worker_assignments: Arc<DashMap<WorkerId, usize, FxBuildHasher>>,
    /// Counter for round-robin assignment of new WorkerIds.
    worker_assignment_count: Arc<AtomicUsize>,

    /// Channels to send tasks to worker threads (one per thread).
    /// Sending `WorkerTask::Terminate` signals the thread to shut down.
    worker_event_channels: Vec<flume::Sender<WorkerTask>>,

    /// Number of worker threads.
    num_workers: usize,
    /// Block size for KV cache.
    kv_block_size: u32,

    /// Handles to worker threads for joining on shutdown.
    thread_handles: Mutex<Vec<JoinHandle<()>>>,

    /// Approximate-mode TTL pruning manager. None for normal event-driven mode.
    prune_manager: Option<WorkerPruneManager>,

    /// Cancellation token for the threaded prune pump.
    prune_pump_cancel: Option<tokio_util::sync::CancellationToken>,

    /// Synthetic event IDs for approximate store/remove events.
    synthetic_event_id: Arc<AtomicU64>,
}

impl<T: SyncIndexer> ThreadPoolIndexer<T> {
    /// Create a new `ThreadPoolIndexer` wrapping the given backend.
    ///
    /// Spawns `num_workers` OS threads, each running a blocking recv loop
    /// that processes events by calling `backend.apply_event()`.
    ///
    /// # Arguments
    ///
    /// * `backend` - The thread-safe data structure to wrap
    /// * `num_workers` - Number of worker threads for event processing
    /// * `kv_block_size` - Block size for KV cache
    ///
    /// # Panics
    ///
    /// Panics if `num_workers` is 0.
    pub fn new(backend: T, num_workers: usize, kv_block_size: u32) -> Self {
        Self::new_with_metrics(backend, num_workers, kv_block_size, None)
    }

    /// Create a new `ThreadPoolIndexer` with optional metrics.
    ///
    /// Same as [`new`](Self::new) but allows passing `KvIndexerMetrics` so that
    /// each worker thread records `kv_cache_events_applied` counters, matching
    /// the observability of the single-threaded `KvIndexer` path.
    ///
    /// # Arguments
    ///
    /// * `backend` - The thread-safe data structure to wrap
    /// * `num_workers` - Number of worker threads for event processing
    /// * `kv_block_size` - Block size for KV cache
    /// * `metrics` - Optional metrics to record event application counts
    ///
    /// # Panics
    ///
    /// Panics if `num_workers` is 0.
    pub fn new_with_metrics(
        backend: T,
        num_workers: usize,
        kv_block_size: u32,
        metrics: Option<Arc<KvIndexerMetrics>>,
    ) -> Self {
        Self::new_with_metrics_and_pruning(backend, num_workers, kv_block_size, metrics, None)
    }

    pub fn new_with_pruning(
        backend: T,
        num_workers: usize,
        kv_block_size: u32,
        prune_config: PruneConfig,
    ) -> Self {
        Self::new_with_metrics_and_pruning(
            backend,
            num_workers,
            kv_block_size,
            None,
            Some(prune_config),
        )
    }

    pub fn new_with_metrics_and_pruning(
        backend: T,
        num_workers: usize,
        kv_block_size: u32,
        metrics: Option<Arc<KvIndexerMetrics>>,
        prune_config: Option<PruneConfig>,
    ) -> Self {
        assert!(num_workers > 0, "Number of workers must be greater than 0");
        super::warn_on_unit_block_size("thread_pool", kv_block_size);

        let backend = Arc::new(backend);
        let mut worker_event_senders = Vec::new();
        let mut thread_handles = Vec::new();
        let worker_assignments = Arc::new(DashMap::with_hasher(FxBuildHasher));
        let worker_assignment_count = Arc::new(AtomicUsize::new(0));
        let synthetic_event_id = Arc::new(AtomicU64::new(0));
        for worker_idx in 0..num_workers {
            let (event_sender, event_receiver) = flume::unbounded::<WorkerTask>();
            worker_event_senders.push(event_sender);

            let backend = Arc::clone(&backend);
            let metrics = metrics.clone();

            let handle = std::thread::spawn(move || {
                // This is observability, not recovery: if the worker panics, log
                // through tracing and then preserve the panic for join().
                let panic_result = std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| {
                    if let Err(error) = backend.worker(event_receiver, metrics) {
                        tracing::error!(
                            worker_thread_index = worker_idx,
                            ?error,
                            "Thread pool worker exited with an error; worker thread is now dead"
                        );
                    }
                }));

                if let Err(panic_payload) = panic_result {
                    let panic_msg = panic_payload_message(&*panic_payload);
                    tracing::error!(
                        target: "dynamo_kv_router::thread_pool_worker_panic",
                        worker_thread_index = worker_idx,
                        panic_message = %panic_msg,
                        "Thread pool worker panicked; worker thread is now dead"
                    );
                    std::panic::resume_unwind(panic_payload);
                }
            });
            thread_handles.push(handle);
        }

        let prune_manager = prune_config.map(WorkerPruneManager::new);
        let prune_pump_cancel = prune_manager.as_ref().map(|prune_manager| {
            let cancel = tokio_util::sync::CancellationToken::new();
            Self::spawn_prune_pump(
                prune_manager.clone(),
                worker_event_senders.clone(),
                Arc::clone(&worker_assignments),
                Arc::clone(&worker_assignment_count),
                num_workers,
                Arc::clone(&synthetic_event_id),
                cancel.clone(),
            );
            cancel
        });

        Self {
            backend,
            worker_assignments,
            worker_assignment_count,
            worker_event_channels: worker_event_senders,
            num_workers,
            kv_block_size,
            thread_handles: Mutex::new(thread_handles),
            prune_manager,
            prune_pump_cancel,
            synthetic_event_id,
        }
    }

    /// Get a reference to the underlying backend.
    pub fn backend(&self) -> &T {
        &self.backend
    }

    /// Get a cloned `Arc` to the underlying backend.
    ///
    /// Useful when a caller needs to hand off an owned `Arc<T>` to a blocking
    /// task (e.g. `tokio::task::spawn_blocking`) without cloning the backend
    /// itself.
    pub fn backend_arc(&self) -> Arc<T> {
        Arc::clone(&self.backend)
    }

    pub(crate) async fn worker_lookup_stats(&self) -> WorkerLookupStats {
        let mut receivers = Vec::new();
        for channel in &self.worker_event_channels {
            let (resp_tx, resp_rx) = oneshot::channel();
            if channel.send(WorkerTask::Stats(resp_tx)).is_ok() {
                receivers.push(resp_rx);
            }
        }

        let mut worker_blocks = BTreeMap::new();
        for receiver in receivers {
            if let Ok(stats) = receiver.await {
                for (worker, block_count) in stats.worker_blocks {
                    *worker_blocks.entry(worker).or_insert(0usize) += block_count;
                }
            }
        }

        WorkerLookupStats::from_worker_block_counts(worker_blocks)
    }

    pub async fn get_workers(&self) -> Vec<WorkerId> {
        self.worker_lookup_stats()
            .await
            .worker_blocks
            .into_iter()
            .map(|(worker, _)| worker.worker_id)
            .collect::<BTreeSet<_>>()
            .into_iter()
            .collect()
    }

    /// Enqueue a structural anchor on the same worker queue used by normal
    /// events for this worker. Branch-sharded routing uses this to preserve
    /// Anchor-before-Stored ordering for the dependent suffix on that queue.
    pub(crate) fn enqueue_anchor(
        &self,
        worker: WorkerWithDpRank,
        anchor: super::AnchorTask,
    ) -> Result<(), KvRouterError> {
        let thread_idx = Self::get_or_assign_thread_idx(
            &self.worker_assignments,
            &self.worker_assignment_count,
            worker.worker_id,
            self.num_workers,
        );
        self.worker_event_channels[thread_idx]
            .send(WorkerTask::Anchor { worker, anchor })
            .map_err(|_| KvRouterError::IndexerOffline)?;
        self.maybe_enqueue_cleanup(thread_idx);
        Ok(())
    }

    /// Wait until all previously queued worker tasks have completed.
    ///
    /// Used primarily for testing and benchmarking to ensure writes are visible
    /// before checking results.
    pub async fn flush(&self) {
        let mut receivers = Vec::new();
        for channel in &self.worker_event_channels {
            let (resp_tx, resp_rx) = oneshot::channel();
            if channel.send(WorkerTask::Flush(resp_tx)).is_ok() {
                receivers.push(resp_rx);
            }
        }
        for receiver in receivers {
            let _ = receiver.await;
        }
    }

    fn get_or_assign_thread_idx(
        worker_assignments: &DashMap<WorkerId, usize, FxBuildHasher>,
        worker_assignment_count: &AtomicUsize,
        worker_id: WorkerId,
        num_workers: usize,
    ) -> usize {
        *worker_assignments.entry(worker_id).or_insert_with(|| {
            let idx = worker_assignment_count.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
            idx % num_workers
        })
    }

    fn next_synthetic_event_id(synthetic_event_id: &AtomicU64) -> u64 {
        synthetic_event_id.fetch_add(1, std::sync::atomic::Ordering::Relaxed)
    }

    fn block_entries_for_hashes(
        worker: WorkerWithDpRank,
        sequence_hashes: &[SequenceHash],
    ) -> Vec<BlockEntry> {
        sequence_hashes
            .iter()
            .enumerate()
            .map(|(idx, h)| BlockEntry {
                key: ExternalSequenceBlockHash(*h),
                worker,
                seq_position: idx,
            })
            .collect()
    }

    fn stored_event_for_hashes(
        worker: WorkerWithDpRank,
        local_hashes: &[LocalBlockHash],
        sequence_hashes: &[SequenceHash],
        event_id: u64,
    ) -> RouterEvent {
        let blocks = local_hashes
            .iter()
            .zip(sequence_hashes.iter())
            .map(|(local_hash, sequence_hash)| KvCacheStoredBlockData {
                tokens_hash: *local_hash,
                block_hash: ExternalSequenceBlockHash(*sequence_hash),
                mm_extra_info: None,
            })
            .collect();

        RouterEvent::new(
            worker.worker_id,
            KvCacheEvent {
                event_id,
                data: KvCacheEventData::Stored(KvCacheStoreData {
                    parent_hash: None,
                    start_position: None,
                    blocks,
                }),
                dp_rank: worker.dp_rank,
            },
        )
    }

    fn enqueue_prune_removes(
        worker_event_channels: &[flume::Sender<WorkerTask>],
        worker_assignments: &DashMap<WorkerId, usize, FxBuildHasher>,
        worker_assignment_count: &AtomicUsize,
        num_workers: usize,
        synthetic_event_id: &AtomicU64,
        entries: Vec<BlockEntry>,
    ) {
        let mut by_worker: BTreeMap<WorkerWithDpRank, BTreeSet<ExternalSequenceBlockHash>> =
            BTreeMap::new();
        for entry in entries {
            by_worker.entry(entry.worker).or_default().insert(entry.key);
        }

        for (worker, hashes) in by_worker {
            let event_id = Self::next_synthetic_event_id(synthetic_event_id);
            let event = RouterEvent::new(
                worker.worker_id,
                KvCacheEvent {
                    event_id,
                    data: KvCacheEventData::Removed(KvCacheRemoveData {
                        block_hashes: hashes.into_iter().collect(),
                    }),
                    dp_rank: worker.dp_rank,
                },
            );
            let thread_idx = Self::get_or_assign_thread_idx(
                worker_assignments,
                worker_assignment_count,
                worker.worker_id,
                num_workers,
            );
            if let Err(error) = worker_event_channels[thread_idx].send(WorkerTask::Event(event)) {
                tracing::warn!(
                    thread_idx,
                    ?error,
                    "Failed to enqueue approximate TTL remove event"
                );
            }
        }
    }

    fn spawn_prune_pump(
        prune_manager: WorkerPruneManager,
        worker_event_channels: Vec<flume::Sender<WorkerTask>>,
        worker_assignments: Arc<DashMap<WorkerId, usize, FxBuildHasher>>,
        worker_assignment_count: Arc<AtomicUsize>,
        num_workers: usize,
        synthetic_event_id: Arc<AtomicU64>,
        cancel: tokio_util::sync::CancellationToken,
    ) {
        if let Ok(handle) = tokio::runtime::Handle::try_current() {
            handle.spawn(async move {
                let mut ready_rx = prune_manager.subscribe_ready();
                loop {
                    tokio::select! {
                        _ = cancel.cancelled() => break,
                        changed = ready_rx.changed() => {
                            if changed.is_err() {
                                break;
                            }
                            loop {
                                let entries = prune_manager.drain_pending_removes();
                                if entries.is_empty() {
                                    break;
                                }
                                Self::enqueue_prune_removes(
                                    &worker_event_channels,
                                    &worker_assignments,
                                    &worker_assignment_count,
                                    num_workers,
                                    &synthetic_event_id,
                                    entries,
                                );
                            }
                        }
                    }
                }
            });
        }
    }

    fn maybe_enqueue_cleanup(&self, thread_idx: usize) {
        if !self.backend.try_schedule_cleanup() {
            return;
        }

        if let Err(e) =
            self.worker_event_channels[thread_idx].send(WorkerTask::CleanupStaleChildren)
        {
            self.backend.cancel_scheduled_cleanup();
            tracing::error!(
                "Failed to send cleanup task to worker thread {}: {:?}",
                thread_idx,
                e
            );
        }
    }

    async fn record_routing_decision_hashes(
        &self,
        worker: WorkerWithDpRank,
        local_hashes: &[LocalBlockHash],
        sequence_hashes: &[SequenceHash],
    ) -> Result<(), KvRouterError> {
        if local_hashes.len() != sequence_hashes.len() {
            tracing::warn!(
                local_len = local_hashes.len(),
                sequence_len = sequence_hashes.len(),
                "Mismatched routing-decision hash lengths"
            );
            return Err(KvRouterError::IndexerDroppedRequest);
        }

        let Some(prune_manager) = &self.prune_manager else {
            // Approximate routing decisions are only recorded when explicitly enabled.
            return Ok(());
        };

        let event_id = Self::next_synthetic_event_id(&self.synthetic_event_id);
        let event = Self::stored_event_for_hashes(worker, local_hashes, sequence_hashes, event_id);
        let prune_entries = Self::block_entries_for_hashes(worker, sequence_hashes);
        let thread_idx = Self::get_or_assign_thread_idx(
            &self.worker_assignments,
            &self.worker_assignment_count,
            worker.worker_id,
            self.num_workers,
        );

        let (resp_tx, resp_rx) = oneshot::channel();
        self.worker_event_channels[thread_idx]
            .send(WorkerTask::EventWithAck {
                event,
                resp: resp_tx,
            })
            .map_err(|_| KvRouterError::IndexerOffline)?;

        let applied = resp_rx
            .await
            .map_err(|_| KvRouterError::IndexerDroppedRequest)?;
        if applied {
            prune_manager.insert_worker_block_entries(worker, prune_entries);
        }

        Ok(())
    }

    pub async fn process_routing_decision_with_hashes(
        &self,
        worker: WorkerWithDpRank,
        local_hashes: Vec<LocalBlockHash>,
        sequence_hashes: Vec<SequenceHash>,
    ) -> Result<(), KvRouterError> {
        self.record_routing_decision_hashes(worker, &local_hashes, &sequence_hashes)
            .await
    }

    pub async fn process_routing_decision_hash_slices(
        &self,
        worker: WorkerWithDpRank,
        local_hashes: &[LocalBlockHash],
        sequence_hashes: &[SequenceHash],
    ) -> Result<(), KvRouterError> {
        self.record_routing_decision_hashes(worker, local_hashes, sequence_hashes)
            .await
    }
}

impl<T: SyncIndexer> Drop for ThreadPoolIndexer<T> {
    fn drop(&mut self) {
        if let Some(cancel) = &self.prune_pump_cancel {
            cancel.cancel();
        }
        if let Some(prune_manager) = &self.prune_manager {
            prune_manager.shutdown();
        }

        // Send Terminate to all worker threads so they exit their recv loops
        // and drop their Arc<T> clones. Then join the threads to ensure the
        // clones are actually dropped before the compiler drops `self.backend`.
        // Without this, worker threads may still be alive when `backend` drops,
        // keeping the Arc refcount > 0 and preventing T::drop() from running.
        for channel in self.worker_event_channels.iter() {
            let _ = channel.send(WorkerTask::Terminate);
        }
        let handles = std::mem::take(
            &mut *self
                .thread_handles
                .lock()
                .expect("thread_handles mutex poisoned"),
        );
        for handle in handles {
            let _ = handle.join();
        }
    }
}

#[async_trait]
impl<T: SyncIndexer> KvIndexerInterface for ThreadPoolIndexer<T> {
    async fn find_matches(
        &self,
        sequence: Vec<LocalBlockHash>,
    ) -> Result<OverlapScores, KvRouterError> {
        // Execute inline on caller's thread - no channel dispatch
        Ok(self.backend.find_matches(&sequence, false))
    }

    async fn find_matches_for_request(
        &self,
        tokens: &[u32],
        lora_name: Option<&str>,
        is_eagle: Option<bool>,
    ) -> Result<OverlapScores, KvRouterError> {
        let sequence = compute_block_hash_for_seq(
            tokens,
            self.kv_block_size,
            BlockHashOptions {
                lora_name,
                is_eagle,
                ..Default::default()
            },
        );
        Ok(self.backend.find_matches(&sequence, false))
    }

    async fn apply_event(&self, event: RouterEvent) {
        let worker_id = event.worker_id;

        // Get or assign worker thread index using sticky round-robin
        let thread_idx = Self::get_or_assign_thread_idx(
            &self.worker_assignments,
            &self.worker_assignment_count,
            worker_id,
            self.num_workers,
        );

        // Send event to the assigned worker thread
        if let Err(e) = self.worker_event_channels[thread_idx].send(WorkerTask::Event(event)) {
            tracing::error!(
                "Failed to send event to worker thread {}: {:?}",
                thread_idx,
                e
            );
            return;
        }

        self.maybe_enqueue_cleanup(thread_idx);
    }

    async fn remove_worker(&self, worker_id: WorkerId) {
        if let Some(prune_manager) = &self.prune_manager {
            prune_manager.remove_worker(worker_id);
        }

        // Route to the worker's assigned thread (if any), otherwise broadcast
        // to all threads since dp_ranks may be spread across threads.
        let thread_idx = self.worker_assignments.get(&worker_id).map(|v| *v);
        match thread_idx {
            Some(idx) => {
                if let Err(e) =
                    self.worker_event_channels[idx].send(WorkerTask::RemoveWorker(worker_id))
                {
                    tracing::error!(
                        "Failed to send RemoveWorker to worker thread {}: {:?}",
                        idx,
                        e
                    );
                    return;
                }

                self.maybe_enqueue_cleanup(idx);
            }
            None => {
                // Worker was never assigned a thread - broadcast to all
                for channel in &self.worker_event_channels {
                    let _ = channel.send(WorkerTask::RemoveWorker(worker_id));
                }
                self.maybe_enqueue_cleanup(0);
            }
        }
    }

    async fn remove_worker_dp_rank(&self, worker_id: WorkerId, dp_rank: DpRank) {
        if let Some(prune_manager) = &self.prune_manager {
            prune_manager.remove_worker_dp_rank(WorkerWithDpRank::new(worker_id, dp_rank));
        }

        // Broadcast to all threads — the dp_rank may be on any thread.
        // Don't remove from worker_assignments since other dp_ranks may still exist.
        for channel in &self.worker_event_channels {
            let _ = channel.send(WorkerTask::RemoveWorkerDpRank(worker_id, dp_rank));
        }
        self.maybe_enqueue_cleanup(0);
    }

    fn shutdown(&self) {
        if let Some(cancel) = &self.prune_pump_cancel {
            cancel.cancel();
        }
        if let Some(prune_manager) = &self.prune_manager {
            prune_manager.shutdown();
        }

        // Send shutdown signal to all worker threads
        for channel in self.worker_event_channels.iter() {
            let _ = channel.send(WorkerTask::Terminate);
        }

        // Take ownership of thread handles and join them
        let handles = std::mem::take(
            &mut *self
                .thread_handles
                .lock()
                .expect("thread_handles mutex poisoned"),
        );
        for handle in handles {
            if let Err(e) = handle.join() {
                tracing::error!("Worker thread panicked during shutdown: {:?}", e);
            }
        }
    }

    async fn dump_events(&self) -> Result<Vec<RouterEvent>, KvRouterError> {
        // Send DumpEvents to every worker as a FIFO barrier: each worker must
        // finish processing all previously queued Events before it handles
        // DumpEvents, so by the time all workers respond we know the shared
        // tree (if any) reflects every event that was enqueued before this call.
        let mut receivers = Vec::new();

        for channel in &self.worker_event_channels {
            let (resp_tx, resp_rx) = oneshot::channel::<anyhow::Result<Vec<RouterEvent>>>();
            let dump_req = WorkerTask::DumpEvents(resp_tx);

            channel
                .send(dump_req)
                .map_err(|_| KvRouterError::IndexerOffline)?;
            receivers.push(resp_rx);
        }

        let mut all_events = Vec::new();
        let mut event_id_counter = 0u64;

        for resp_rx in receivers {
            let mut events = resp_rx
                .await
                .map_err(|_| KvRouterError::IndexerDroppedRequest)?
                .map_err(|_| KvRouterError::IndexerOffline)?;
            for event in &mut events {
                event.event.event_id = event_id_counter;
                event_id_counter += 1;
            }
            all_events.extend(events);
        }

        // Shared-state backends keep their tree in concurrent structures
        // readable from any thread. Now that the barrier above guarantees
        // all queued writes have landed, dump directly.
        if let Some(events) = self.backend.dump_events() {
            return Ok(events);
        }

        // Per-thread-state backends returned their events through the DumpEvents
        // responses collected above.
        Ok(all_events)
    }

    async fn process_routing_decision_for_request(
        &self,
        tokens_with_hashes: &mut TokensWithHashes,
        worker: WorkerWithDpRank,
    ) -> Result<(), KvRouterError> {
        tokens_with_hashes.get_or_compute_seq_hashes();
        let local_hashes = tokens_with_hashes
            .block_hashes()
            .expect("block hashes missing after computing sequence hashes");
        let sequence_hashes = tokens_with_hashes
            .seq_hashes()
            .expect("sequence hashes missing after computing sequence hashes");
        self.record_routing_decision_hashes(worker, local_hashes, sequence_hashes)
            .await
    }

    async fn flush(&self) -> usize {
        let curr_size: usize = self.worker_event_channels.iter().map(|ch| ch.len()).sum();
        self.flush().await;

        if let Some(prune_manager) = &self.prune_manager {
            let entries = prune_manager.drain_due_and_pending(tokio::time::Instant::now());
            Self::enqueue_prune_removes(
                &self.worker_event_channels,
                &self.worker_assignments,
                &self.worker_assignment_count,
                self.num_workers,
                &self.synthetic_event_id,
                entries,
            );
            self.flush().await;

            let entries = prune_manager.drain_pending_removes();
            let has_entries = !entries.is_empty();
            Self::enqueue_prune_removes(
                &self.worker_event_channels,
                &self.worker_assignments,
                &self.worker_assignment_count,
                self.num_workers,
                &self.synthetic_event_id,
                entries,
            );
            if has_entries {
                self.flush().await;
            }
        }
        curr_size
    }

    fn timing_report(&self) -> String {
        self.backend.timing_report()
    }

    async fn shard_sizes(&self) -> Vec<ShardSizeSnapshot> {
        let stats = self.worker_lookup_stats().await;
        vec![ShardSizeSnapshot {
            shard_idx: 0,
            worker_count: stats.worker_count(),
            block_count: stats.block_count(),
            node_count: self.backend.node_count(),
        }]
    }

    fn node_edge_lengths(&self) -> Vec<usize> {
        self.backend.node_edge_lengths()
    }
}