Brewers Conjecture and a characterization of the limits, and relationships between Consistency, Availability and Partition Tolerance in a distributed service

April 23, 2019 Β· Declared Dead Β· πŸ› October 2011 on the ParElastic blog that can now be found archived on the Internet Wayback machine at http://bit

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Amrith Kumar, Kenneth Rugg arXiv ID 1904.12636 Category cs.DC: Distributed Computing Cross-listed cs.DB, cs.SE Citations 0 Venue October 2011 on the ParElastic blog that can now be found archived on the Internet Wayback machine at http://bit Last Checked 4 months ago
Abstract
In designing a distributed service, three desirable attributes are Consistency, Availability and Partition Tolerance. In this note we explore a framework for characterizing these three in a manner that establishes definite limits and relationships between them, and explore some implications of this characterization.
Community shame:
Not yet rated
πŸ“„ View on arXiv 🌐 View on ar5iv πŸ“‘ PDF πŸŽ‰ Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted