Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.12792 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909692526067712 |
|---|---|
| author | Wan, Yiliang Shivaraman, Nitin Shenoi, Akshaye Liu, Xiang Luo, Tao Li, Jialin |
| author_facet | Wan, Yiliang Shivaraman, Nitin Shenoi, Akshaye Liu, Xiang Luo, Tao Li, Jialin |
| contents | Distributed systems, such as state machine replication, are critical infrastructures for modern applications. Practical distributed protocols make minimum assumptions about the underlying network: They typically assume a partially synchronous or fully asynchronous network model. In this work, we argue that modern data center systems can be designed to provide strong synchrony properties in the common case, where servers move in synchronous lock-step rounds. We prove this hypothesis by engineering a practical design that uses a combination of kernel-bypass network, multithreaded architecture, and loosened round length, achieving a tight round bound under 2us. Leveraging our engineered networks with strong synchrony, we co-design a new replication protocol, Chora. Chora exploits the network synchrony property to efficiently pipeline multiple replication instances, while allowing all replicas to propose in parallel without extra coordination. Through experiments, we show that Chora achieves 255% and 109% improvement in throughput over state-of-the-art single-leader and multi-leader protocols, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12792 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Building State Machine Replication Using Practical Network Synchrony Wan, Yiliang Shivaraman, Nitin Shenoi, Akshaye Liu, Xiang Luo, Tao Li, Jialin Distributed, Parallel, and Cluster Computing Distributed systems, such as state machine replication, are critical infrastructures for modern applications. Practical distributed protocols make minimum assumptions about the underlying network: They typically assume a partially synchronous or fully asynchronous network model. In this work, we argue that modern data center systems can be designed to provide strong synchrony properties in the common case, where servers move in synchronous lock-step rounds. We prove this hypothesis by engineering a practical design that uses a combination of kernel-bypass network, multithreaded architecture, and loosened round length, achieving a tight round bound under 2us. Leveraging our engineered networks with strong synchrony, we co-design a new replication protocol, Chora. Chora exploits the network synchrony property to efficiently pipeline multiple replication instances, while allowing all replicas to propose in parallel without extra coordination. Through experiments, we show that Chora achieves 255% and 109% improvement in throughput over state-of-the-art single-leader and multi-leader protocols, respectively. |
| title | Building State Machine Replication Using Practical Network Synchrony |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2507.12792 |