THE SCHEDULING ALGORITHM

fn schedule(pool: &ThreadPool) -> Result<Task> {
    let queue = pool.work_steal();
    match queue.pop_front() {
        Some(task) => task.execute(),
        None => pool.park(),
    }
}

ConcEngine spawns lightweight tasks onto a fixed worker pool, then routes them through a work-stealing deque. Idle workers steal from peers' tail; busy workers push to their own head. The result: contention-free scheduling at memory-bus speed.