# Solutions toensurewrnr95r5 c suppose we have 6

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: oup. Then, it learns that Q and R and W have joined the group. Then it learns that X joins the group. A while later it learns that R leaves and then learns that X crashes. Show different views of the process P from the initial to the final stages of the above scenario. Solutions: P0 = {P} P1 = {P, Q, R, W} P2 = {P, Q, R, W, X} P3 = {P, Q, W, X} P4 = {P, Q, W} (b) Given 9 replicas, if updates are reflected on 5 replicas and include timestamps, what is the minimum number of replicas we must read to ensure that we have at least one up‐ to‐date data. Solutions: To ensure W + R > N, R > 9 ‐5, R>= 5 (c) Suppose we have 6 replicas with write-all, read-all policy in which view-based quorum is used with a write threshold of 4, in case of partiti...
View Full Document

## This note was uploaded on 02/07/2013 for the course CS 425 taught by Professor Hu during the Spring '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online