Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
Raft algorithm not only allows linearizable read through Read Index or Lease Read, but also allows linearizable read on the follower nodes, which can increase the read throughput linearly with the number of nodes. Algorithm specific processes can refer to Raft thesis in section 6.4
Our project, Apache IoTDB, is trying to build our high availability module using Ratis. We want Ratis to support linearizable follower read so that we can mask the concept of replicas for upper layers, that is, reading the latest data at any node.
In our survey, sofa-jraft, etcd, tikv-rs and other famous consensus algorithms libraries have supported linearizable follower read. As the only consensus algorithm library under the Apache Foundation, we expect Ratis to support this feature as well, and I'm happy to participate in further discussions and development.
Attachments
Attachments
Issue Links
- relates to
-
RATIS-1262 Support linearizable read
- Resolved
-
RATIS-1864 Support leader lease
- Resolved
- links to