Circuit Breakers : Break, before it breaks you!
In general it is a very simple pattern. You just wrap your function/method/behaviour with another function which keeps track of the failures/success of the that function (service/DB calls) and opens or closes the circuit for you. Sounds simple enough. It is simple.
Quick to digest cheatsheet – for GoLang
I have been learning and playing around with GoLang lately and it seem to be fun. At first being a Java developer it looks weird and complex, but once you start playing around it is quite fun. Why did […]
Integration Testing with Test Containers
Testing is one of the most critical parts of the Software Development Lifecycle. Writing meaningful unit/integration tests with enough coverage is really important. It saves your system from critical bug injection, helps meeting functional requirements and gives clear understanding […]
How search engine works ? Elastic search – (Part-2)
Hello! Welcome to the part-2 of “How search engine works” series. Previous part was all about the basic concepts that go behind a search engine at a low level. If you want to refer the previous part, feel free and […]
Parallel Programming in Java – (Part-2)
Hello, welcome to the second part of “Parallel Programming in Java” series. If you have somehow missed the first part and want to read it now, then read it here. So Part-1 covered the very basic concept of task execution […]
Parallel Programming in Java (Part – 1)
Hello all, A huge welcome to my new article, which is about making optimal use of the super machines that are available to run our systems in the current world. It is really awesome that the computing and storage costs […]
Readable Code : Just like a fairy tale
Most software today is very much like an Egyptian pyramid with millions of bricks piled on top of each other, with no structural integrity, but just done by brute force and thousands of slaves. – Alan Kay Writing code is […]
Dynamic Programming
Dynamic Programming (Memoization) : As usual lets start with the general definition of dynamic programming. “In computer science DP is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems […]
Deadlock in simple terms
For understanding our first scenario we have to ride a car in a small Village where you have very narrow lanes. Adding to your pain you have buffaloes leading you. I hope you are enjoying the ride 🙂 . After several rounds […]