|
You are here |
speakerdeck.com | ||
| | | | |
decomposition.al
|
|
| | | | | by Devashish Purandare ยท edited by Sohum Banerjea and Lindsey Kuper | |
| | | | |
ongardie.github.io
|
|
| | | | | The Raft Consensus Algorithm | |
| | | | |
chelseatroy.com
|
|
| | | | | In December, I took a course in which we attempted to implement the Raft distributed consensus algorithm fromthis paper. Parts 1-5 of this series share insights from the course. From then on, I'm guiding you through my continued work implementing Raft "for fun" (I know. I don't understand me, either). Here's where you can see... | |
| | | | |
johnjr.dev
|
|
| | | When we study transactions in relational databases, one of the first things we learn are the guarantees that a transaction must provide. ACID(Atomicity, Consistency, Isolation, Durability) are the properties that we desire. Here, I will discuss the Isolation level in more detail and show that atomicity alone is not enough when handling concurrency. One classic example of the importance of atomicity is moving money between accounts. So, imagine that we have two accounts and we would like to transfer the total amount from one account to another one. In a relational database, what we need to do is three steps: | ||