Cache: LWW convergence with timestamp ordering - part 2#11
Merged
Conversation
When multiple processes write the same path, all nodes now converge to the same value regardless of message arrival order. Uses timestamp as primary ordering and publisher name as deterministic tiebreaker.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Cache::set— if the existing entry has a newer timestamp, the incoming write is ignoredContext
Multiple processes can legitimately write the same path (e.g. battery monitor, light sensor, and user process all adjusting
display.backlight). Without ordering, caches on different subscribers could diverge depending on message arrival order.Test plan
stale update is discarded— older timestamp doesn't overwrite newerequal timestamp breaks tie by publisher name— both arrival orders converge to same result