A comparative study of synchronization algorithms in distributed systems

Abstract

A distributed system is a collection of independent computers that appears to its users as a single coherent system and sharing the common resources. Multiple processes do not simultaneously access a shared resource so, requires the synchronization. We are having the four synchronization algorithms in distributed systems. This paper describes the pros & cons of each algorithm. In this we are comparing these four algorithms (Centralized, Decentralized, Distributed and Token Ring algorithms) with appropriate comparative measurements such as time complexity, delay, redundancy, scalability, failure rate & recovery. Based on this comparative study in future we are going to address the problems in the existing synchronization algorithms.