Gradient Clock Synchronization using Reference Broadcasts

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 page, 2 figures

Scientific paper

In this paper we suggest a method by which reference broadcast synchronization (RBS), and other methods of estimating clock values, can be incorporated in standard clock synchronization algorithms to improve synchronization quality. We advocate a logical separation of the task of estimating the clock values of other nodes in the network from the task of using these estimates to output a logical clock value. The separation is achieved by means of a virtual estimate graph, overlaid on top of the real network graph, which represents the information various nodes can obtain about each other. RBS estimates are represented in the estimate graph as edges between nodes at distance 2 from each other in the original network graph. A clock synchronization algorithm then operates on the estimate graph as though it were the original network. To illustrate the merits of this approach, we modify a recent optimal gradient clock synchronization algorithm to work in this setting. The modified algorithm transparently takes advantage of RBS estimates and any other means by which nodes can estimate each others' clock values.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Gradient Clock Synchronization using Reference Broadcasts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Gradient Clock Synchronization using Reference Broadcasts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gradient Clock Synchronization using Reference Broadcasts will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-444757

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.