Distributed Systems

Maekawa’s Algorithm is quorum based approach to ensure mutual exclusion in distributed systems. As we know, In permission based algorithms like Lamport’s Algorithm, Ricart-Agrawala Algorithm etc. a site request permission from…

Ricart–Agrawala algorithm is an algorithm to for mutual exclusion in a distributed system proposed by Glenn Ricart and Ashok Agrawala. This algorithm is an extension and optimization of Lamport’s Distributed Mutual…

Distributed shared memory (DSM) is an abstraction used for sharing data between computers that do not share physical memory. Processes access DSM by reads and updates to what appears to…

Lamport’s Distributed Mutual Exclusion Algorithm is a permission based algorithm proposed by Lamport as an illustration of his synchronization scheme for distributed systems.In permission based timestamp is used to order critical…

Mutual exclusion is a concurrency control property which is introduced to prevent race conditions. It is the requirement that a process can not enter its critical section while another concurrent process…

Process coordination in a multitasking OS  –       Race condition: several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the…

Instead of synchronizing clocks, event ordering can be used If two events occurred at the same process pi (i = 1, 2, … N) then theyoccurred in the order observed by pi, that is order…

Causal ordering is a vital tool for thinking about distributed systems. Once you understand it, many other concepts become much simpler. We'll start with the fundamental property of distributed systems:…

A multicast operation is more appropriate – this is an operation that sends a single message from one process to each of the members of a group of processes, usually in such a…

Designed and implemented by Lampson and colleagues at the DEC Systems Research Center (1986) Provide facilities for resource location, email addressing and authentication When the naming database grows from small…