特别讨论了分布式系统中共享存储等共享内存问题，以及可以作为抽象实现的不同算法。本节将在原子寄存器、已记录的常规寄存器、拜占庭安全寄存器和拜占庭常规寄存器的上下文中讨论这些算法。共识和共识变体是本章的其余部分。除了对这些抽象概念进行理论描述，这本书还帮助学习者通过练习和解决方案来测试他们的知识，从而更好地理解主题。本书的范围包括在不合作进程的恶意操作情况下的安全问题。通俗地说，被称为“拜占庭容错”，包括在这本书中提出的拜占庭的错误规避是一个重要的。研究人员支持实现算法来处理拜占庭断层(Varela & Agha, 2013)。拜占庭式故障是指分布式编程中的错误操作可能导致完全的系统故障。
In timing assumptions, some of the abstractions are discussed with respect asynchronicity. Asynchronous systems and synchronous systems are discussed here. In abstracting time, the form of failure detections is discussed, along with the Byzantine leader election in abstraction which is very important given the nature of working of distributed processes.Some of the other chapters expand on some of the more common issues faced when it comes to distributed systems such as reliable broadcast issues and algorithm. The Fail-Silent, the Fail-Stop and the Fail-Silent with the eager reliable broadcast algorithm are presented here. Probabilistic broadcast, the FIFO and the Causal broadcast and the Byzantine consistent broadcast are discussed in detail. Research works on reliability and consistency issues present shared memory-writing as being a significant issue here. This book hence directs one of its major chapters to the issues of handling fault in shared memory.
In particular, the shared memory issues such as shared storage in distributed system, the different algorithms that could be implemented as abstractions in order to handle them are discussed. The section discusses these algorithms in context of the atomic register, the logged regular register, the byzantine safe register and the byzantine regular register. Consensus and consensus variants are the rest of the chapters. In addition to presenting theoretical descriptions on these abstractions, the book helps learners test their knowledge by exercises and by working on solutions that would facilitate better understanding of the subject. The book scope includes security issues in the case of malicious actions from non-cooperating processes. Popularly, known as “Byzantine fault-tolerance”, the inclusion of the Byzantine fault evasion as presented in this book is a significant one. Researchers support implementing algorithms in order to tackle the Byzantine fault (Varela & Agha, 2013). The byzantine fault is where an incorrect operation because of fault of failure in distributed programming could lead to a complete system failure.