I was wondering what is the relationship between view-change algorithm and Paxos? In my lecture notes it states that "participants in each view agree on the primary, that later on governs the replication process". What is the view in this context and how Paxos relates to this?
view change algorithm and paxos
843 Views Asked by Bober02 At
1
There are 1 best solutions below
Related Questions in DISTRIBUTED-SYSTEM
- How to avoid duplicates with the pull-based subscribe model?
- Micrometer & Prometheus with Java subprocesses that can't expose HTTP
- SQL connection throws error when adding DistributedSession, SessionMiddleware
- How to use NFS locks or any other mechanism to keep data in sync on multiple mountpoints
- The two data nodes return different results
- How to run an MPI program across multiple docker containers without manually ssh'ing
- How do I parallelize writing a list of Pyspark dataframes across all worker nodes?
- Does AWS use distributed systems?
- How to version control a source code which communicates with database?
- Searching for succ(p+1) in Chord systems
- How to design a long running process that can continue after an outtage?
- akka.cluster.ddata.Replicator$Internal$DeltaPropagation message from clusterReceptionist replicator is dropped because it exceeds the size limit
- In the storage-computing separation deployment mode, why does one of the three nodes have no disk space?
- Out-of-order AppendEntries in Raft
- Automatic Load Balancer with Locust 2.20.0 on Windows - High Ping and Scaling Challenges
Related Questions in PAXOS
- In the raft consensus algorithm, is this scene possible?
- Doesn't Paxos end up with the same instructions in the exact same order?
- Paxos algorithm: Dependency of Accept and Prepare phases
- Pax device NFC support
- Cassandra LWT CasWriteUnknownResultException failure status is unclear
- How Raft know previous term log entry committed or not
- Paxos: What happens if the leader lost connection after commit in his own ledger but before multicast the success message?
- Performance of LWT in scylla/cassandra
- How does raft prevent submitted logs from being overwritten
- what is the key difference between multipaxos and basic paxos protocol
- The relationship between Paxos family and data consistency
- Why does Paxos ensure that consensus is reached and does not change?
- In Paxos, why can't we use random backoff to avoid collision?
- How to implement Byzantine Single-decree Paxos?
- How doesn't Hbase use any consensus algorithm like RAFT or Paxos?
Related Questions in DISTRIBUTED-ALGORITHM
- Implementation of distributed greedy algorithm for finding maximum independent set
- What if vector clock update reaches much before the actual update?
- Julia Distributed, failed to modify the global variable of the worker
- Julia Distributed slow down to half the single core performance when adding process
- Julia Parallel Distributed
- Two phase commit: what happens if the coordinator dies between sending two confirmations
- How to implement distributed algorithm of leader election using JBotsim library
- Space complexity of distributed algorithm
- distributed algorithm in C
- implement Broadcast Tree on OMNET++
- is there tool to build distributed search techniques?
- What is the difference between consistent hashing and cone hashing?
- How to classify a failure detector?
- What is the diameter of a graph with just one node?
- What is wrong with this algorithm execution in Java?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The concept of "view" in paxos is applicable in scenarios where the number of nodes (proposers/acceptors/learners) is dynamic.
Imagine a scenario where nodes discover each other via UDP broadcast on startup. At any point in time, you can have a variable number of nodes running. Each time this "number of nodes" changes, that would indicate a new view.
Why this is important is because in such a dynamic environment, how do you ascertain what the "quorom" size is for accepting messages? By prepending a monotonically increasing ViewNumber to the ProposalNumber (also called a Viewstamp), this allows for graceful detection of changes in the "view" or number of nodes.
The whole view/replication concept is coined in the article:
Paxos Made Practical