Class attendance monitoring system with dynamic leader election.
-
Updated
Dec 21, 2016 - Java
Class attendance monitoring system with dynamic leader election.
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.
Distributed-File-Store is a multi-cluster fault tolerant, replicated distributed system which lets you upload, download, and see the catalog of other cluster with low latency and LRU cache capabilities.
Rafty - Simulation of Raft processes
a fault-tolerant key/value storage system on top of Raft consensus algorithm
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.
Projects of MIT 6.824 Distributed Systems 17spring
Playing with Raft consensus algorithm (https://raft.github.io/).
TLA+ Specification of Raft Consensus Algorithm
A cloud-based file storage system patterned on Dropbox that can survive server failure, datacenter failure, and network failures
Map Reduce, Raft implementation using golang. 6.824 MIT
An implementation of the raft consensus algorithm, allowing you to create distributed replicated state machines.
Homebaked etcd as a graduation project
raft impl
Distributed KV store written in python for learning Raft
Raft Consensus Algorithm with gRPC & Go
A distributed fault-tolerant in-memory key-value store implemented with the raft protocol.
a note for MIT distributed system course https://pdos.csail.mit.edu/6.824/schedule.html
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."