« Why most large-scale Web sites are not written in Java | Main | Some Real Financial Numbers for Your Startup »
Wednesday
Oct032007

Paper: Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services

DateWednesday, October 3, 2007 at 1:50AM

Abstract: When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.

AuthorTodd Hoff | CommentPost a Comment | | Print ArticlePrint Article
in

References (1)

References allow you to track sources for this article, as well as articles that were written in response to this article.

Reader Comments

There are no comments for this journal entry. To create a new comment, use the form below.

PostPost a New Comment

Enter your information below to add a new comment.
Author Email (optional):
Author URL (optional):
Post:
 
Some HTML allowed: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <code> <em> <i> <strike> <strong>
Alert
Comment Moderation Enabled
Your comment will not appear until it has been cleared by a website editor.

Notify me of follow-up comments via email.