Jack Kelly

https://github.com/HigherOrderCO/Bend Could imagine writing algorithms in Bend, especially algos which can't be applied chunk-wise. Like reprojection? https://github.com/HigherOrderCO/Bend Although we'd also want to consider Mojo

Maybe we should simplify the code, so we just fill the io_uring submission queue until `len(sq) + len(cq) - MAX_ENTRIES_PER_ITERATION >= SQ_LEN`. Don't bother with the `HIGH_WATER_MARK` idea. I'm not...

Instead of keeping track of things like `GetRanges` in flight, maybe keep track of our own representation of SQEs. Pros: Might simplify our code? e.g. - we won't need to...

`submit` calls [`submit_and_wait`](https://github.com/tokio-rs/io-uring/blob/master/src/submit.rs#L114). `submit_and_wait` always calls `atomic::fence(atomic::Ordering::SeqCst)` when the kernel is configured to use sqpoll. So it _might_ be faster to keep an eye on the clock (in our code),...