원문정보
초록
영어
Synchronization of clocks in distributed system has been an important area of research over the last decade. There are various methods of achieving clock synchronization depending on the requirements of the situation. A clock synchronization service ensures that spatially dispersed and heterogeneous processors in a distributed system share a common notion of time. In order to behave as a single, unified computing resource, distributed systems have need for a synchronization of drifting clocks and several algorithms have been proposed on this topic. Our paper highlights total network connection between different processors (alias nodes) of the system, We provide a simple, efficient, and unified algorithm for clock synchronization that can minimize the total network connection of the system.
목차
1. Introduction
2. Previous works
3. Scope of works
4. Assumptions reading clocks
5. Definitions
5.1. Ready Point
5.2. Sequence of Synchronization
5.3. Reference Node
6. Design methodology of our Algorithm
6.1. Proposed Algorithm
7. Case study
8. Theorems
8.1. Theorem-1
8.2. Theorem 2
9. Result
10. Analysis
11. Proof of concept demonstration
12. Conclusion
References