Affiliation:
1. Istanbul Technical University, Turkey
Abstract
Representing an algorithmic workflow as a state machine is a frequently used technique in distributed systems. Replicating a state machine in a fault tolerant way is one of the main application areas under this context. When implementing a replicated state machine, a crucial problem is to maintain consistency among replicas that might handle various different requests arriving at each different replica. This problem requires maintaining a single consistent ordering of the distributed requests handled separately by replicas. Basic consensus protocols such as two phase commit (2PC), can be used to maintain consistency between replicas whenever a request is to be processed. In this study we modify 2PC protocol to take advantage of basic properties of a state machine and detect possible write conflicts earlier. Our experiments on distributed cloud environments show that our modified 2PC protocol increases the throughput and decrease wasted write operations by a significant amount.
Subject
Computer Networks and Communications,Hardware and Architecture
Reference44 articles.
1. Optimal combined task and message scheduling in distributed real-time systems
2. Sync HotStuff: Simple and Practical Synchronous State Machine Replication
3. Bano, S., Baudet, M., Ching, A., Chursin, A., Danezis, G., Garillot, F., . . . Sonnino, A. (2020). State machine replication in the Libra Blockchain. Available at: https://developers.libra.org/docs/state-machine-replication-paper
4. Strong consistency is not hard to get
5. Bessani, A., Sousa, J., & Alchieri, E. E. (2014, June). State machine replication for the masses with BFT-SMART. In 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (pp. 355-362). IEEE.