When possible, bail out early when quorum achieved #286
Conversation
This file contains 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
The beating heart of all consensus based distributed algorithms is to scatter a computation across multiple nodes, then to gather their results, then to evaluate whether quorum is achieved. In some cases, _quorum_ requires gathering all of the nodes' results (e.g., interrogating all nodes for a maximum value for a variable). But in other cases, _quorum_ requires gathering only `n // 2 + 1` nodes' results (e.g., figuring out if > 50% of nodes believe that I'm the owner of a lock). This commit implements the logic to "bail out" early when possible, in the latter case.
brainix
force-pushed
the
early-bail-out
branch
3 times, most recently
from
1bf7f19
to
0380a77
Compare
brainix
force-pushed
the
early-bail-out
branch
from
0380a77
to
c9b4294
Compare
|
🐟 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The beating heart of all consensus based distributed algorithms is to
scatter a computation across multiple nodes, then to gather their
results, then to evaluate whether quorum is achieved.
In some cases, quorum requires gathering all of the nodes' results
(e.g., interrogating all nodes for a maximum value for a variable).
But in other cases, quorum requires gathering only
n // 2 + 1nodes'results (e.g., figuring out if > 50% of nodes believe that I'm the owner
of a lock).
This commit implements the logic to "bail out" early when possible, in
the latter case.