Did we miss P In CAP? Partial Progress Conjecture under Asynchrony
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918128694329344 |
|---|---|
| author | Chen, Junchao Gupta, Suyash Hughes, Daniel P. Sadoghi, Mohammad |
| author_facet | Chen, Junchao Gupta, Suyash Hughes, Daniel P. Sadoghi, Mohammad |
| contents | Each application developer desires to provide its users with consistent results and an always-available system despite failures. Boldly, the CALM theorem disagrees. It states that it is hard to design a system that is both consistent and available under network partitions; select at most two out of these three properties. One possible solution is to design coordination-free monotonic applications. However, a majority of real-world applications require coordination. We resolve this dilemma by conjecturing that partial progress is possible under network partitions. This partial progress ensures the system appears responsive to a subset of clients and achieves non-zero throughput during failures. To this extent, we present the design of our CASSANDRA consensus protocol that allows partitioned replicas to order client requests. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_00021 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Did we miss P In CAP? Partial Progress Conjecture under Asynchrony Chen, Junchao Gupta, Suyash Hughes, Daniel P. Sadoghi, Mohammad Distributed, Parallel, and Cluster Computing Databases Each application developer desires to provide its users with consistent results and an always-available system despite failures. Boldly, the CALM theorem disagrees. It states that it is hard to design a system that is both consistent and available under network partitions; select at most two out of these three properties. One possible solution is to design coordination-free monotonic applications. However, a majority of real-world applications require coordination. We resolve this dilemma by conjecturing that partial progress is possible under network partitions. This partial progress ensures the system appears responsive to a subset of clients and achieves non-zero throughput during failures. To this extent, we present the design of our CASSANDRA consensus protocol that allows partitioned replicas to order client requests. |
| title | Did we miss P In CAP? Partial Progress Conjecture under Asynchrony |
| topic | Distributed, Parallel, and Cluster Computing Databases |
| url | https://arxiv.org/abs/2501.00021 |