Distributed System is a collection of self-governing computer systems efficient of transmission and cooperation among each other by the means of interconnections between their hardware and software. It is a collection of loosely coupled processor that appears to its users a single systematic system. Distributed systems has various limitations such as in distributed system there is not any presence of a global state. This differentiates distributed system computing from databases in which a steady global state is maintained.
Distributed system limitations has the impact on both design and implementation of distributed systems. There are mainly two limitations of the distributed system which are as following:
1. Absence of a Global Clock 2. Absence of Shared Memory
The above two limitations of the distributed system are explained as following below:
1. Absence of a Global Clock:
In a distributed system there are a lot of systems and each system has its own clock. Each clock on each system is running at a different rate or granularity leading to them asynchronous. In starting the clocks are regulated to keep them consistent, but only after one local clock cycle they are out of the synchronization and no clock has the exact time.
Time is known for a certain precision because it is used for the following in distributed system:
- Temporal ordering of events
- Collecting up-to-date information on the state of the integrated system
- Scheduling of processes
There are restrictions on the precision of time by which processes in a distributed system can synchronize their clocks due to asynchronous message passing. Every clock in distributed system is synchronize with a more reliable clock, but due to transmission and execution time lapses the clocks becomes different. Absence of global clock make more difficult the algorithm for designing and debugging of distributed system.
2. Absence of Shared Memory:
Distributed systems have not any physically shared memory, all computers in the distributed system have their own specific physical memory. As computer in the distributed system do not share the common memory, it is impossible for any one system to know the global state of the full distributed system. Process in the distributed system obtains coherent view of the system but in actual that view is partial view of the system.
As in distributed system there is an absence of a global state, it is challenging to recognize any global property of the system. The global state in distributed system is divided by many number of computers into smaller entities.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Various Failures in Distributed System
- What is DFS(Distributed File System)?
- Mutual exclusion in distributed system
- Design Issues of Distributed System
- Features of Distributed Operating System
- Logical Clock in Distributed System
- Hierarchical Deadlock Detection in Distributed System
- Lamport's Algorithm for Mutual Exclusion in Distributed System
- Maekawa’s Algorithm for Mutual Exclusion in Distributed System
- Suzuki–Kasami Algorithm for Mutual Exclusion in Distributed System
- Ricart–Agrawala Algorithm in Mutual Exclusion in Distributed System
- Difference between Token based and Non-Token based Algorithms in Distributed System
- Distributed Application Paradigms
- Disadvantages of Distributed DBMS
- Hashing in Distributed Systems
- Synchronization in Distributed Systems
- Advantages of Distributed database
- Difference between Network OS and Distributed OS
- Concepts of Distributed databases
- Deadlock detection in Distributed systems
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.