Skip to main content

Scaling application

 We all wish that our application used by maximum people on Earth. To make sure we have the right scalable application, please follow below guidelines 


1. Load balancing at all level of application i.e. web server, application server and DB server

2. Remote caching to be enabled for a fast response. 

3. Load balancer will equally distribute the traffic to existing servers, what if enough capacity is not enough. We should have a mechanism to increase the server capacity (esp horizontally ).  All the cloud service provider has provision for autoscaling, so do Kubernetes.  Use them. 

4. Most of the NoSQL DB comes with good support for horizontal scalability. So if you chosse NoSQL you can easily scale them. But if your application requires RDBMS (SQL) then plan should be with sharding in place. 

5. Server should be stateless. Any server should be able to serve an incoming request. No local storage, no IP binding. Having said newly added server will start serving instantly. 

6. CI and CD should be used to deploy the application node instantly for capacity increase. 

7. Test and monitor of application should be placed well in case the new version does play a spoilsport. We should be comb off and revert to a stable version.  A monitor will alert for issues earlier and can prompt for face-saving action. :)

8. DB Query optimization using index 

9. Using async operation for network/ server issues. It provides scalability to receiving application. A reactive approach to application development will be highly scalable. 

10. Use containerization to reduce deployment surprises between env and existing orchestration tools provide better support for scaling. 


Refer https://12factor.net/ for more details. 

Labels:

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