Consider a quorum consensus protocol in which an item is stored as n replicas, and the size of read and write quorums are p and q respectively.
a. What is the maximum number of replica sites that can fail and still have the protocol work correctly?
b. What is the minimum value that p and q can have such that p = q?
c. Select p and q so that the maximum number of replica sites can fail and still have the protocol work correctly. For this selection, how many sites can fail?
a. The minimum of n ? p and n ? q.
b. The smallest integer greater than n/2
c. p and q are both selected to be the smallest integer greater than n/2. The number of sites that can fail is then the largest integer less than n/2. For example, if n = 7, p and q are both equal to 4, and 3 sites can fail.
You might also like to view...
If you need to find out how many days between two dates, which function would you use?
A) DAYSBETWEEN B) DAY C) DAYS D) EDATE
Method drawOval’s arguments specify ________.
a. the upper-left and upper-right corners of the oval. b. the upper-left corner, scale and size of the oval. c. the position and size of the bounding rectangle for the oval. d. the position and size of the bounding cycle for the oval.