Rithvik Panchapakesan

Rithvik Panchapakesan

Auto-generated profile, based on publicly available information

Rithvik Panchapakesan

University of California, Berkeley, Berkeley, CA, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
DCDavid C.Y. Chu
David C.Y. Chu
RPRithvik Panchapakesan
Rithvik Panchapakesan
SLShadaj Laddad
Shadaj Laddad
LKLucky E. Katahanas
Lucky E. Katahanas
CLChris Liu
Chris Liu
HHHeidi Howard
Heidi Howard
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× and Paxos by 3×, 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.

3 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
DCDavid Chu
David Chu
RPRithvik Panchapakesan
Rithvik Panchapakesan
SLShadaj Laddad
Shadaj Laddad
LKLucky Katahanas
Lucky Katahanas
CLChris Liu
Chris Liu
HHHeidi Howard
Heidi Howard
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.