Skip to content

Tag Archives: Distributed System

File caching enhances I/O performance because previously read files are kept in the main memory. Because the files are available locally, the network transfer is… Read More
Consensus is a general agreement on a decision made by the majority of those involved. For example, the problem may be as simple as friends… Read More
A distributed system is a computing environment in which different components are dispersed among several computers (or other computing devices) connected to a network. These… Read More
Distributed Systems are the systems that make a single system image to users of the networks. The failure of one system in the network will… Read More
In this article, we will learn about the features of a good scheduling algorithm in a distributed system. Fault Tolerance: A good global scheduling algorithm… Read More
DSM is a mechanism that manages memory across multiple nodes and makes inter-process communications transparent to end-users. The applications will think that they are running… Read More
A distributed shared memory is a system that allows end-user processes to access shared data without the need for inter-process communication. The shared-memory paradigm applied… Read More
Introduction :The goal of distributed scheduling is to distribute a system’s load across available resources in a way that optimizes overall system performance while maximizing… Read More
Overview :The concept of ‘Self Stabilization’ was first proposed by Dijkstra in 1974. It is a general technique for non-masking distributed systems. It is a… Read More
A procedure to reach a common agreement in a distributed or decentralized multi-agent platform. It is important for the message passing system. Example –  A… Read More
Communication between two processes in a distributed system is required to exchange various data, such as code or a file, between the processes. When one… Read More
Consider we are given with a set of grocery stores where the head of all store wants to query about the available sanitizers inventory at… Read More
1. Eventual Consistency : Eventual consistency is a consistency model that enables the data store to be highly available. It is also known as optimistic… Read More
Vector Clock is an algorithm that generates partial ordering of events and detects causality violations in a distributed system. These clocks expand on Scalar time… Read More
Distributed databases brings advantages of distributed computing which consists huge number of processing elements, elements may be heterogeneous. Elements are connected with network which help… Read More