This Thursday we had another meeting of the architecture club where we finished the second part of the book about Database Internals, which is about distributed systems.
This Thursday we had Another meeting of the club of architecture loversThe second part of the book about Database Internals is devoted to distributed systems. And at the same time, we finished talking about the whole book:) If you missed past episodes, you can read about them here: 1, 2, 3. At the meeting, we discussed the chapters: — Chapter 12. Anti-Entropy And Dissemination — Chapter 13. Distributed Transactions — Chapter 14. Consensus — Part II. Conclusion
We had guests in this episode: — Vitaly Kondratov is my colleague, an architect in the basic technologies department of Tinkoff. It develops and refines databases, as well as infrastructure for their operation. Sergey Baranov – the founder of the conference ArchDays and my colleague on the program committee of this conference, as well as the author of Agile Mindset and the Telegram channel.Microservices – Russian-speaking community».
Below is a brief summary of the last chapters, and the details can be read in the attached article.
The twelfth chapter is devoted to the mechanisms that are necessary for the operation of eventually consistent systems in which replicas and discrepancies of their states exist. In the case of tunable consistency, consistency is generally allowed to be exchanged for availability, so mechanisms are needed to address these discrepancies. The thirteenth chapter discusses how to move from one object and one operation consistency models to many atomic operations. This chapter is worth reading for yourself, but if you generalize, the author considers two variants of atomic commitment algorithms and consensus algorithms. All the previous topics have brought us closer to the pinnacle of distributed systems research, namely consensus. Consensus algorithms allow a distributed system of multiple processes to reach agreement on a value. From the point of view of theory, such algorithms should have the following three properties: agreement, validity, termination. The fourteenth chapter concludes the book.
#SoftwareArchitecture #Databases #Software #ExternalReview