Synchronization in Distributed Systems
In the present scenario, a demand for the highly reliable and synchronous systems is seen. As a result, there has been a gradual shift to distributed systems from the centralized systems. There are few disadvantages for this system too. The most important one is that in a distributed system, the different nodes maintain their own time using local clocks and their time values may not be same for the different nodes. I.e. there is no global clock within the system so that that the various activities in the distributed environment can be synchronized. The various clocks in the system even if set to a common time value at an instant, drift apart due to unavoidable reasons. Hence some kind of continuous mechanism for synchronization is needed so that they can coordinate and work together to achieve the objectives of the distributed system. Two types of synchronization are possible- external synchronization and internal synchronization. In a real time scenario, it is important for the system to be synchronous with each other and with a common external reference time. This is called external synchronization. But in certain systems, it is only necessary for the nodes in the system to be synchronized with each other. This is called internal synchronization. In many applications, the relative ordering of events is more important than actual physical time. Here event ordering is done without clock time values. Hence, depending on the area and type of application, clock synchronization techniques used differs.
In certain real time applications, the system requires to be both internally and externally synchronized. In such cases a centralized algorithm called the ‘Cristian’s’ algorithm is used for synchronization. But this algorithm fails in situations where the time server fails. This paper suggests some methods to make the synchronization process distributed so that the disadvantages of the Cristian’s algorithm can be nullified.
KeywordsSynchronization Centralized Algorithms Distributed Systems
Unable to display preview. Download preview PDF.
- 3.Sinha, P.K.: Distributed Operating Systems: Concepts and Design, pp. 282–336. PHI Learning Private Limited (2009)Google Scholar
- 4.Housni, A., Trehel, M.: Distributed mutual exclusion token-permission based by prioritized groups. In: Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, pp. 253–259 (June 2001)Google Scholar
- 5.Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: IEEE International Symposium on Cluster Computing and the Grid, pp. 539–546 (2004)Google Scholar
- 6.Nishimura, T., Hayashibara, N., Enokido, T., Takizawa, M.: Causally Ordered Delivery with Global Clock in Hierarchical Group. In: Proceedings of the 2005 11th International Conference on Parallel and Distributed Systems, ICPADS 2005 (2005)Google Scholar
- 7.Latha, C.A., Shashidhara, H.L.: Clock Synchronization in Distributed Systems. In: 5th International Conference on Industrial and Information Systems, pp. 475–480 (July-August 2010)Google Scholar
- 8.Distributed Systems: Clock Synchronisation, UTC, Clock drift and skew (2010), http://www.krzyzanowski.org/rutgers/lectures/l-clocks.html
- 9.Distributed Systems: Principles and Paradigms, Physical and logical clocks (2010), http://net.pku.edu.cn/~course/cs501/2008/resource/steen_vrije/courses/ds-slides/2006/notes.06.pdf
- 10.Applied Computer Science Problems: Clock and State Synchronization, Clock Synchronisation algorithms (2010), http://www.sti-innsbruck.at/fileadmin/documents/teaching_archive/acsp0405/06_Ruff_Ausarbeitung.pdf