Struct WorkStealingScheduler 

pub struct WorkStealingScheduler { /* private fields */ }

Work-stealing scheduler for distributed brick execution

Implements work-stealing algorithm where idle workers steal tasks from busy workers’ queues. This provides automatic load balancing.

Algorithm

1. Each worker has a local deque (double-ended queue)
2. Workers push/pop from their own queue (LIFO - good for cache locality)
3. When idle, workers steal from other queues (FIFO - steal oldest tasks)
4. Stealing considers data locality via BrickDataTracker

Implementations

impl WorkStealingScheduler

pub fn new(data_tracker: Arc<BrickDataTracker>) -> Self

Create a new work-stealing scheduler

pub fn register_worker(&self, worker_id: WorkerId) -> Arc<WorkerQueue>

Register a worker with the scheduler

pub fn unregister_worker(&self, worker_id: WorkerId)

Unregister a worker

pub fn submit(&self, spec: TaskSpec, input_key: String) -> u64

Submit a task to the best worker based on locality

pub fn submit_priority( &self, spec: TaskSpec, input_key: String, priority: u32, ) -> u64

Submit with explicit priority

pub fn get_work(&self, worker_id: WorkerId) -> Option<WorkStealingTask>

Try to get work for a worker (local pop or steal)

pub fn stats(&self) -> SchedulerStats

Get scheduler statistics

pub fn data_tracker(&self) -> &Arc<BrickDataTracker>

Get the data tracker

Trait Implementations

impl Debug for WorkStealingScheduler

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.