C suppose we have 6 replicas with write all read all

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: rns 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. (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. (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 partition. If the system is partitioned into two parts of 3 nodes each, can we read and write in any of these partitions...
View Full Document

This document was uploaded on 11/11/2013.

Ask a homework question - tutors are online