Category: Distributed Systems.

OTHER CONSISTENCY MODELS

Models of memory consistency can be divided into uniform models, which do not distinguish between types of memory access, and…

Overlay case studies: Pastry, Tapestry

The prefix routing approach is adopted by both Pastry and Tapestry. Pastry is the message routing infrastructure deployed in several…

Peer to Peer Computing

The peer to peer computing architecture contains nodes that are equal participants in data sharing. All the tasks are equally…

Consensus and agreement algorithms

Comparison between Checkpoint Schemes

Table 1. Comparison between uncoordinated, coordinated and qusi-synchronoun checkpointing Coordinated checkpointing algorithms are made up by using the following scheme:…

Types of Checkpointing

ROLLBACK RECOVERY MECHANISM

Log-Based rollback Recovery Mechanism Checkpoint-Based Rollback Recovery Mechanism In checkpointing based rollback recovery is a well-established technique to deal with…

Checkpoint-Recovery

Introduction Checkpoint-Recovery is a common technique for imbuing a program or system with fault tolerant qualities, and grew from the…

Deadlock detection

In a distributed system deadlock can neither be prevented nor avoided as the system is so vast that it is…

Suzuki–Kasami Algorithm

Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems.This is modification of Ricart–Agrawala algorithm, a permission based…

Maekawa’s Algorithm

Maekawa’s Algorithm is quorum based approach to ensure mutual exclusion in distributed systems. As we know, In permission based algorithms like…

Ricart–Agrawala Algorithm

Ricart–Agrawala algorithm is an algorithm to for mutual exclusion in a distributed system proposed by Glenn Ricart and Ashok Agrawala. This…