work-queue

A concurrent work-stealing queue for building schedulers.

Examples

Distribute some tasks in a thread pool:

```rust use work_queue::{Queue, LocalQueue};

struct Task(Box) + Send>);

let threads = 4;

let queue: Queue = Queue::new(threads, 128);

// Push some tasks to the queue. for _ in 0..500 { queue.push(Task(Box::new(|local| { do_work();

    local.push(Task(Box::new(|_| do_work())));
    local.push(Task(Box::new(|_| do_work())));
})));

}

// Spawn threads to complete the tasks. let handles: Vec<_> = queue .localqueues() .map(|mut localqueue| { std::thread::spawn(move || { while let Some(task) = localqueue.pop() { task.0(&mut localqueue); } }) }) .collect();

for handle in handles { handle.join().unwrap(); } ```

Comparison with crossbeam-deque

This crate is similar in purpose to crossbeam-deque, which also provides concurrent work-stealing queues. However there are a few notable differences:

Implementation

This crate's queue implementation is based off [Tokio's current scheduler]. The idea is that each thread holds a fixed-capacity local queue, and there is also an unbounded global queue accessible by all threads. In the general case each worker thread will only interact with its local queue, avoiding lots of synchronization - but if one worker thread happens to have a lot less work than another, it will be spread out evenly due to work stealing.

Additionally, each local queue stores a [non-stealable LIFO slot] to optimize for message passing patterns, so that if one task creates another, that created task will be polled immediately, instead of only much later when it reaches the front of the local queue.

Testing

License

MIT OR Apache-2.0