CS 6410 09nov2010 Time Vainstein K. Chocolate to Motivate the Discussion. please take 1 each during 0 th traversal may commence eating, once you participate milk chocolate: in red wrappers really seriously very bitter dark chocolate: small bars, in black wrappers
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Mills, D.L. Network Time Protocol (Version 3) specification, implementation and analysis. Network Working Group Report RFC-1305, University of Delaware, March 1992
Time, Clocks, and the Ordering of Events in a Distributed System, Lamport. CACM 21(7). July 1978.
Gunther N. J., The Practical Performance Analyst, McGraw-Hill 2000
Christoph Lenzen, Thomas Locher, and Roger Wattenhofer. 2010. Tight bounds for clock synchronization. J. ACM 57, 2, Article 8 (February 2010)
"to prove existence of a combinatorial structure with certain properties, we construct an appropriate probability space, and show that a randomly chosen element of this space has the desired property, with positive probability"
"no bound on clock reading error"