Skip to content

Tag Archives: Distributed System

A distributed system is a system in which components are situated in distinct places, these distinct places refer to networked computers which can easily communicate… Read More
As earlier discussed access matrix is likely to be very sparse and takes up a large chunk of memory. Therefore direct implementation of access matrix… Read More
Interprocess Communication is a process of exchanging the data between two or more independent process in a distributed environment is called as Interprocess communication. Interprocess… Read More
Chandy-Misra-Haas’s distributed deadlock detection algorithm is an edge chasing algorithm to detect deadlock in distributed systems.  In edge chasing algorithm, a special message called probe… Read More
Prerequisite – Types of Operating Systems In this topic we shall see the difference between Network Operating System and Distributed Operating System. The main difference… Read More
Prerequisite – Mutual exclusion in distributed systems Raymond’s tree based algorithm is lock based algorithm for mutual exclusion in a distributed system in which a site… Read More
Prerequisite: Mutual exclusion in distributed systems  Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems.This is modification of Ricart–Agrawala algorithm, a… Read More
Distributed shared memory(DSM) system is a resource management component of distributed operating system that implements shared memory model in distributed system which have no physically… Read More
Each distributed system has a number of processes running on a number of different physical servers. These processes communicate with each other via communication channels… Read More
Huang’s algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Shing-Tsaan Huang in 1989 in the Journal of… Read More
Prerequisite: Deadlock detection in Distributed systems In hierarchical deadlock detection algorithm, sites are arranged in a hierarchical fashion and a site detects deadlocks involving only… Read More
Prerequisite: Mutual exclusion in distributed systems Lamport’s Distributed Mutual Exclusion Algorithm is a permission based algorithm proposed by Lamport as an illustration of his synchronization… Read More
Prerequisite – Mutual exclusion in distributed systems Maekawa’s Algorithm is quorum based approach to ensure mutual exclusion in distributed systems. As we know, In permission… Read More
Prerequisite: Mutual exclusion in distributed systems Ricart–Agrawala algorithm is an algorithm to for mutual exclusion in a distributed system proposed by Glenn Ricart and Ashok… Read More
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… Read More

Start Your Coding Journey Now!