pub fn gather_delivery_order(t: &FlashTimings, pages: &[u64]) -> Vec<usize>Expand description
For a pure read gather, the order in which the requested pages’ data arrives — indices
into pages, sorted by delivery beat (ties broken by issue order). Near-storage compute
consumes beats in THIS order, so a reduction fed at the storage edge (merge-on-ingest,
scan, hash) must be SOUND under it: the die-interleave that saturates the bus reorders the
stream, so only order-invariant reductions (a CRDT join, a commutative fold) are safe here.