Simple (incomplete) implementation of Raft consensus
-
Updated
Sep 3, 2018 - Go
Simple (incomplete) implementation of Raft consensus
A key-value storage system that can continue to operate in the face of failures, such as server crashes. This is achieved by using the Raft protocol.
Alexandria (named after the Library of Alexandria) is a in-memory, distributed key-value store written in Go. It is NoSQL, eventually consistent, and highly available.
Rafty - Simulation of Raft processes
a fault-tolerant key/value storage system on top of Raft consensus algorithm
Map Reduce, Raft implementation using golang. 6.824 MIT
Homebaked etcd as a graduation project
Raft Consensus Algorithm with gRPC & Go
A distributed fault-tolerant in-memory key-value store implemented with the raft protocol.
Projects of MIT 6.824 Distributed Systems 17spring
a note for MIT distributed system course https://pdos.csail.mit.edu/6.824/schedule.html
A simple Example of a distributed data store written in go using hashicorp's raft implementation
Opensource projects on Hyperledger
Rafty is a library for maintaining a replicated state machine following the Raft consensus protocol
Raft consensus algorithm. Based on MIT 6.824.
Go implemented, fault tolerant distributed system based on RAFT consesus algorithm.
Implementation of Raft consensus algorithm in GO
Implementation of Raft: A distributed consensus protocol, in Go.
fault tolerant Key-Value store based on RAFT protocol
Add a description, image, and links to the raft-consensus-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the raft-consensus-algorithm topic, visit your repo's landing page and select "manage topics."