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

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)
Post a Comment
Read more

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node is parent/grand parent of other. order should be O(1). tag root as 0 , tag left child as 00 , right child as 01. left child's left child as 000 , left's child's right child as 001 ... and so on. now let input be tags t1 and t2 if( (t1 == (t2>>1)) || (t2==(t1>>1))) return child parent relationship if( (t1 == (t2>>2)) || (t2==(t1>>2))) return child grand-parent relationship ... This solution can take a lot of space as the three grows. We can tag the node by number .. Root -0 1 -2-3-4 SO given two node get their tags.. Get Max of both t1, t2. Go for parent of that node if other node then return or check for parent of parent and check again for other node. With 2^32 value avaialable for indexing ..u wont run out of values.
Post a Comment
Read more