In this series of articles, I will summarize the course materials that were taught by Andrew Ng. The course is available online and I will make it easy and short to follow. To start, let me define what is machine learning(ML)? It is a computer program that learns from experience…

To start, let me define what is consistency. Consistency is a property of the distributed system, which says that upon reading the objects that stored on many replicas, the results of reading operations from different clients should have some guarantee based on the consistency model. Consistency models are a contract…

The main purpose of locking is to control transactions. This is obvious when there are concurrent transactions in the system. There are two types of Locks called available Shared S(a) to read data items and Exclusive X(a) to both read and write data items. To guarantee serializability in a distributed…

A two-phase commit is a standardized protocol used in a distributed database for ensuring atomic commitment where all involved nodes are committed or aborted the transactions from their logs. In database management, saving data changes is known as a commit, and undoing changes are known as a rollback. 2PC brokes…

Consistent Hashing is a distributed hashing scheme that uses in distributed systems to solve load balancing. It is consistent because adding or removing servers did not cause a complete recalculation of the hash table. Let us look back to a system that used no consistent hashing scheme. In such a…

To start, let me remind you what is cache. A cache is a hardware or software component for storing data. The cache allows the client to find the data faster than other types of memory. For instance, the simple cache architecture for web applications is illustrated in the figure below.

In this article, I will summarize the preprint paper called BedRock. The BedRock was written by Mohammed Javad and other researchers like Mohammed Sadoghi. In this post, I explain BedRock, a new tool that explores many BFT protocol design choices and generates a best fit protocol based on the developers'…

This paper studied BFT trusted protocols namely Trust-BFT. The Trust-BFT protocol refers to a protocol that requires 2F+1 replicas with a trusted component. A trusted component is a cryptographically secure entity with a negligible probability of being compromised by byzantine adversaries. …