The race described here sounds pretty similar to a type of cache consistency race: Client X reads a complex value from a database, does some calculation, and wr

The race described here sounds pretty similar to a type of cache consistency race: Client X reads a complex value from a database, does some calculation, and writes the result in a cache. Client Y updates something that should invalidate the calculation. When Client Y tries to invalidate the cache, they don't yet see Client X's entry, which will then appear slightly later. Now a stale value persists in the cache. The assumption is that after the invalidate done by Y, the cache cannot contain a value that missed Y's update is incorrect.