A simple and hackable job system for Odin.

Latest tested Odin version: dev-2023-12-nightly:31b1aef4

The design is inspired by fiber-based job systems, most notably the one used at Naughty Dog. (see Parallelizing the Naughty Dog Engine).

BUT This scheduler doesn't use fibers! The queued jobs are just executed directly on the waiting thread. From an API perspective, this is basically the same as fibers. It might require more stack space in your worker threads, but there is no need to allocate stacks for fibers.

Also there is no chance of ending up on another thread after using wait, so you can use TLS and OS-provided synchronization primitives like Mutexes and Semaphores.

• dispatching and waiting for jobs to finish
• nested jobs
• utilities for batch processing of slices/arrays
• full control over the thread processing loop
• support for Windows, Linux and Drawin

• the jobs are queued on a linked list (FILO queue)
• individual jobs are allocated with context.temp_allocator (or manually)
• jobs are intended to finish within one frame, but you can make long running tasks with a custom allocator.

main :: proc() {
    jobs.initialize()

    g: jobs.Group
    jobs.dispatch(.Medium, jobs.make_job(&g, hello_job))
    jobs.wait(&g)

    jobs.shutdown()
}

hello_job :: proc(_: rawptr) {
    fmt.println("Hello from thread", jobs.current_thread_index())
}

See the examples directory for all examples.

All examples:

• hello - a very basic introduction to jobs
• simple - simple overview with most of the features
• boids - boids simulation with Raylib
• background - long-running tasks over multiple frames
• efficient_spinning - using a custom thread proc to sleep whenever no jobs are available to save power

• improve the examples (boids are especially wonky)
• use atomic linked list instead of spinlocks
• Per-job debug labels
• Profiler integration (with core:prof/spall by default)

All contributions are welcome!