Distributed Systems

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

The prefix routing approach is adopted by both Pastry and Tapestry. Pastry is the message routing infrastructure deployed in several applications including PAST [Druschel and Rowstron 2001], an archival (immutable)…

The peer to peer computing architecture contains nodes that are equal participants in data sharing. All the tasks are equally divided between all the nodes. The nodes interact with each…

Table 1. Comparison between uncoordinated, coordinated and qusi-synchronoun checkpointing Coordinated checkpointing algorithms are made up by using the following scheme: • All process checkpointing: This requires all processes in the…

Log-Based rollback Recovery Mechanism Checkpoint-Based Rollback Recovery Mechanism In checkpointing based rollback recovery is a well-established technique to deal with process failures and increase the system reliability and fault-tolerance in…

Introduction Checkpoint-Recovery is a common technique for imbuing a program or system with fault tolerant qualities, and grew from the ideas used in systems which employ transaction processing [lyu95]. It…

In a distributed system deadlock can neither be prevented nor avoided as the system is so vast that it is impossible to do so. Therefore, only deadlock detection can be…

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 (Non-token based) algorithm which uses REQUEST and REPLY messages to ensure mutual exclusion. In…