Posted inDistributed Systems
Maekawa’s Algorithm
Maekawa’s Algorithm is quorum based approach to ensure mutual exclusion in distributed systems. As we know,…
Posted inDistributed Systems
Ricart–Agrawala Algorithm
Ricart–Agrawala algorithm is an algorithm to for mutual exclusion in a distributed system proposed by Glenn…
Posted inDistributed Systems
DISTRIBUTED SHARED MEMORY
Distributed shared memory (DSM) is an abstraction used for sharing data between computers that do…
Posted inDistributed Systems
Lamport’s Algorithm
Lamport’s Distributed Mutual Exclusion Algorithm is a permission based algorithm proposed by Lamport as an illustration…
Posted inDistributed Systems
Mutual exclusion in distributed system
Mutual exclusion is a concurrency control property which is introduced to prevent race conditions. It is…
Posted inDistributed Systems
Distributed Mutual Exclusion
Process coordination in a multitasking OS – Race condition: several processes access and manipulate the same…
Posted inDistributed Systems
Logical time and logical clocks
Instead of synchronizing clocks, event ordering can be used If two events occurred at the…
Posted inDistributed Systems
Causal ordering
Causal ordering is a vital tool for thinking about distributed systems. Once you understand it,…
Posted inDistributed Systems
Group communication
A multicast operation is more appropriate – this is an operation that sends a single message from…
Posted inDistributed Systems
Global Name Service (GNS)
Designed and implemented by Lampson and colleagues at the DEC Systems Research Center (1986) Provide…