An introduction to lockless algorithms
An introduction to lockless algorithms
Posted Feb 20, 2021 0:56 UTC (Sat) by gus3 (guest, #61103)In reply to: An introduction to lockless algorithms by pebolle
Parent article: An introduction to lockless algorithms
"For any op <, =, >, if A op B, and B op C, then A op C." That is to say:
-- If A < B, and B < C, then A < C
-- If A = B, and B = C, then A = C
-- If A > B, and B > C, then A > C
Referring to the statement you quoted, it could be re-stated thus:
"Given an action A, the time tA at which action A takes place, and any op <, =, >:
If tP op tQ, and tQ op tR, then tP op tR."
That may seem thick, but instead of just A, B, and C, I've just substituted locations on a time-line instead of a number line.
It may seem obvious, and it kind of is. But stating applicable axioms explicitly is standard practice in rigorous maths discussions.
