Files
java-interview-lab/food-delivery/output/10-partner-claim.txt
T

9 lines
564 B
Plaintext

16 orders reach for one free rider, 5000 rounds
===============================================
Timing dependent: the naive count differs from run to run; the compare-and-set count never does.
naive, check then write, nothing in between: rounds where more than one order got the rider: 0 of 5000, most winners in one round 1
naive, with a yield between the check and the write: rounds where more than one order got the rider: 389 of 5000, most winners in one round 7
atomic (compare-and-set), no gap needed: rounds with anything other than one winner: 0 of 5000