Optimizing Distributed Protocols with Query Rewrites [Technical Report]
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913824560381952 |
|---|---|
| author | Chu, David Panchapakesan, Rithvik Laddad, Shadaj Katahanas, Lucky Liu, Chris Shivakumar, Kaushik Crooks, Natacha Hellerstein, Joseph M. Howard, Heidi |
| author_facet | Chu, David Panchapakesan, Rithvik Laddad, Shadaj Katahanas, Lucky Liu, Chris Shivakumar, Kaushik Crooks, Natacha Hellerstein, Joseph M. Howard, Heidi |
| contents | Distributed protocols such as 2PC and Paxos lie at the core of many systems in the cloud, but standard implementations do not scale. New scalable distributed protocols are developed through careful analysis and rewrites, but this process is ad hoc and error-prone. This paper presents an approach for scaling any distributed protocol by applying rule-driven rewrites, borrowing from query optimization. Distributed protocol rewrites entail a new burden: reasoning about spatiotemporal correctness. We leverage order-insensitivity and data dependency analysis to systematically identify correct coordination-free scaling opportunities. We apply this analysis to create preconditions and mechanisms for coordination-free decoupling and partitioning, two fundamental vertical and horizontal scaling techniques. Manual rule-driven applications of decoupling and partitioning improve the throughput of 2PC by $5\times$ and Paxos by $3\times$, and match state-of-the-art throughput in recent work. These results point the way toward automated optimizers for distributed protocols based on correct-by-construction rewrite rules. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_01593 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimizing Distributed Protocols with Query Rewrites [Technical Report] Chu, David Panchapakesan, Rithvik Laddad, Shadaj Katahanas, Lucky Liu, Chris Shivakumar, Kaushik Crooks, Natacha Hellerstein, Joseph M. Howard, Heidi Distributed, Parallel, and Cluster Computing Databases Distributed protocols such as 2PC and Paxos lie at the core of many systems in the cloud, but standard implementations do not scale. New scalable distributed protocols are developed through careful analysis and rewrites, but this process is ad hoc and error-prone. This paper presents an approach for scaling any distributed protocol by applying rule-driven rewrites, borrowing from query optimization. Distributed protocol rewrites entail a new burden: reasoning about spatiotemporal correctness. We leverage order-insensitivity and data dependency analysis to systematically identify correct coordination-free scaling opportunities. We apply this analysis to create preconditions and mechanisms for coordination-free decoupling and partitioning, two fundamental vertical and horizontal scaling techniques. Manual rule-driven applications of decoupling and partitioning improve the throughput of 2PC by $5\times$ and Paxos by $3\times$, and match state-of-the-art throughput in recent work. These results point the way toward automated optimizers for distributed protocols based on correct-by-construction rewrite rules. |
| title | Optimizing Distributed Protocols with Query Rewrites [Technical Report] |
| topic | Distributed, Parallel, and Cluster Computing Databases |
| url | https://arxiv.org/abs/2404.01593 |