Skip to main content

CAP theorem demystified


In a web world, everything is available over the internet. While designing a distributed application for the client, we often face this dilemma of choosing between consistency and availability.  There is no further argument if we don't choose to have a partition tolerant system, that's single node application and it will adhere to consistency and availability. So we will be discussing Partition tolerant systems for a distributed environment.  Lets first understand CAP individual elements;

C (Consistency): 
In a distributed environment of n nodes, a change in one node should be instantly reflected all other nodes. So any data change/state should be reflected all client irrespective of whichever node they access the data. 


A (Availability):

All the non-failing node should be ready to serve any request within a reasonable time. This applies to every node present in the system. 

P (Partition Tolerence):

Distributed systems are meant to build partition tolerant systems. Any node creation and removal should be gracefully handled. 


A distributed system need to partition tolerant, So P axis will be fixed. As there is a contradiction between Consistency and availability, we have to fine-tune them for business cases. 

Example: I have 3 servers with user data in place. Now All three have the same data, so any read request will be having consistent data for any read request to any node.  Now if user A has modified his details and call has been made to server S1 at T0. So data is updated at S1 at T0 but will be propagated to S2 and S3 post T4 (Assume). So either S2 and S3 will choose to decline any request till T4 to maintain consistency and compromise availability or will continue to serve request but with an outdated data. 

And that's gist of CAP theorem. 

Comments

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

JAVA CLASSLOADER- Types, usages.

JVM loads library and classes dynamically only. Its on demand only. A Class will be loaded only when needed and only once. There can be system supported class loader and user supplied class loader. When JVM starts it loads three type of class loader 1. Bootstrap loader - When system boots. Loads from jre_home/lib/ 2. External class loader - Loads from jre_home/lib/ext. 3. System Class loader - Loads classes from system property CLASSPATH. Besides this user can provide their own class loader which is pretty easy to implement in Java. User supplied loader will work in conjunction with other loader i.e. system loader too. Some of the examples are: 1. Load library at runtime from http resources. Example scripting classes, bean classes. 2. Can load encrypted class files with new class loader. 3. Modify the byte code. Application Container loads classes from deployed WAR or EAR files using a tree of class loaders.
Post a Comment
Read more

Permutations Sum(xi)

You have given "k" dice. How many way you can get a sum "S" and yes you have to throw all the dice. Write program for this. Its same permutations program...but we have to try with all the six S(1,2,3,4,5,6) possibilities for a dice. Exit condition will be If all the dice run out. SumP(dice,sum) = SumP(dice-1,sum-i)+i (from S).
1 comment
Read more