Saved Bookmarks
| 1. |
What Are The Issues Resolved By Berkeley’s Algorithm? |
|
Answer» The collections of COMPUTERS WHOSE clocks are to be synchronized are categorized as masters and slaves. The AVERAGING of the clock values cancels out the individual’s clocks tendencies to run fast or slow. This overcomes the uncertainty due to message TRANSMISSION time INTRODUCED in the synchronized clock values returned by the master. The collections of computers whose clocks are to be synchronized are categorized as masters and slaves. The averaging of the clock values cancels out the individual’s clocks tendencies to run fast or slow. This overcomes the uncertainty due to message transmission time introduced in the synchronized clock values returned by the master. |
|