/CmRaft

Raft algorithm implementation in Java

Primary LanguageJavaApache License 2.0Apache-2.0

Project CmRaft

Project CmRaft is a Java implementation of Raft algorithm, which is a consensus algorithm that is designed to be easy to understand. It's equivalent to Paxos in fault-tolerance and performance. The difference is that it's decomposed into relatively independent subproblems, and it cleanly addresses all major pieces needed for practical systems. Check this link for more detailed information about Raft algorithm: https://raftconsensus.github.io/

CmRaft implemented leader election, log replication and log persistence so far. Membership changing and log compaction will be implemented soon.

Build

Prerequisites:

  • JDK 1.7
  • Maven 3.x

Download source code:

	git clone https://github.com/chicm/CmRaft.git

Compile and make tar ball:

	mvn package -DskipTests

Import to eclipse:

	mvn eclispe:eclipse

Then use eclipse to open the project. To run a unit test, which will create a local cluster and test the basic functions in command line console:

	maven test

Key value store APIs usage:

Key value store APIs allow users to manipulate key value pairs against a replicated key value store inside CmRaft cluster, including adding, updating, deleting, listing, etc. It's very simple to use key value store APIs:

	try(Connection conn = ConnectionManager.getConnection()) { 
		KeyValueStore kvs = conn.getKeyValueStore();
		kvs.set("key1", "value1"); 
		kvs.set("key1", "value2"); 
		kvs.delete("key1");  
		String value = kvs.get("key1");  
		List<KeyValue> result = kvs.list(); 
	} finally {
	}