The RUM Conjecture states that we cannot design an access method for a storage system that is optimal in all the following three aspects - Reads, Updates, and, Memory. The conjecture puts forth that we always have to trade one to make the other two optimal and this makes the thr…
Consistent Hashing is one of the most sought after techniques when it comes to designing really scalable distributed systems. In this article, we dive …
Arpit Bhayani
An integer in Python is not a traditional 2, 4, or 8-byte implementation but rather it is implemented as an array of digits in base 2^30 which enables …
Arpit Bhayani
Binary Search is an algorithm that finds the position of a target value in a sorted list. The algorithm exploits the fact that the list is sorted, and …
Arpit Bhayani
Copy-On-Write, abbreviately referred to as CoW suggests deferring the copy process until the first modification. A resource is usually copied when we d…
Arpit Bhayani
Disk reads are 4x (for SSD) to 80x (for magnetic disk) slower as compared to main memory (RAM) reads and hence it becomes extremely important for a dat…
Arpit Bhayani
Finite State Machine is a mathematical model of computation that models a sequential logic. FSM consists of a finite number of states,  transition func…
Arpit Bhayani
Almost every single website, app, or platform on the internet has some sort of rating system in place. Whenever you purchase a product or use a service…
Arpit Bhayani
See all

Arpit’s Newsletter