The Costs and Limits of Availability for Replicated Services. Presented by: Sarath Chandra Dorbala. Outline of presentation. Introduction A word about consistency protocols Focus of this article Background Details of TACT System Model and Assumptions Availability Upper bound theory
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Presented by: Sarath Chandra Dorbala
Replica A has accepted updates W1 and W2
Replica B has accepted updates W3 and W4.
Update W1 has been propagated from A to B.
The final serialization order of the four writes is W1W2W3W4.
Availclient= accepted accesses/submitted accesses.
Availservice≤ F(consistency, workload, faultload).
To compute the availability upper bound, we only need to focus on writes
writesk,mbe the number of writes accepted by partitionm during intervalk
wsubmitk,m be the number of writes submitted from clients