Balraja SubbiahCalvin — fast distributed transactions for partitioned database systemsWe had been looking at various consensus protocols like 2p and 3p commits, paxos and raft. As a next step we would look into ways for…Jan 6, 2023Jan 6, 2023
Balraja SubbiahRaft — Understandable ConsensusIn my previous post i talked about building distributed consensus using paxos. In continuation of that lets talk about Raft protocol in…Jan 3, 2023Jan 3, 2023
Balraja SubbiahBigTable — DataModelThis is my old blog post, moving it to mediumJan 3, 2023Jan 3, 2023
Balraja SubbiahOld Dynamo Paper — Few HighlightsThis is an article from my old blog post and i am moving everything to medium.Jan 3, 2023Jan 3, 2023
Balraja SubbiahBASE (basically available, soft state, eventually consistent).This paper starts with the limitations of using ACID for distributed databases. Primarily it worries about the 2PC protocol wherein the…Jan 3, 2023Jan 3, 2023
Balraja SubbiahPaxos as I understood itPaxos is a consensus algorithm that widely finds it’s use in lot of consensus systems. The google’s chubby lock service made paxos very…May 30, 20173May 30, 20173
Balraja SubbiahConsensus, Two Phase and Three Phase CommitsAt the heart of every distributed system is a consensus algorithm. Consensus is an act wherein a system of processes agree upon a value or…Jan 7, 20174Jan 7, 20174
Balraja SubbiahLamport Clocks And Vector ClocksThe concept of time is fundamental to our way of thinking about ordering of events in a system. Since physical clocks in a distributed…Jan 7, 20174Jan 7, 20174
Balraja SubbiahConsistent HashingA simple way to distribute pairs among a set of servers is to hash(key) and locate it in a server at (hash(key) MOD NUM_SERVERS). If the…Jan 7, 2017Jan 7, 2017
Balraja SubbiahChord : A Scalable Peer To Peer lookup service for Internet ApplicationsIn continuation with the previous post on consistent hashing, today we will look at a distributed lookup protocol by name Chord. The…Dec 15, 2016Dec 15, 2016
