{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T02:21:48Z","timestamp":1771554108002,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":28,"publisher":"Springer-Verlag","isbn-type":[{"value":"0387973850","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0042327","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:59:35Z","timestamp":1153994375000},"page":"84-96","source":"Crossref","is-referenced-by-count":45,"title":["An overview of clock synchronization"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Simons","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cComplexity of Network Synchronization,\u201d J. ACM vol. 32, no. 4, pp. 804\u2013823, 1985.","journal-title":"J. ACM"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/2402.322387","volume":"30","author":"E. Arjomandi","year":"1983","unstructured":"E. Arjomandi, M. Fischer, and N. Lynch, \u201cEfficiency of Synchronous vs. Asynchronous Distributed Systems,\u201d J. ACM, vol. 30, no. 3, pp. 449\u2013456, July 1983.","journal-title":"J. ACM"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, \u201cAnother Advantage of Free Choice: Completely Asynchronous Agreement Protocols,\u201d Proc. 2nd Ann. ACM Symp. on Principles of Distributed Computing, pp. 27\u201330, 1983.","DOI":"10.1145\/800221.806707"},{"key":"7_CR4","unstructured":"J. Burns and N. Lynch, \u201cThe Byzantine Firing Squad Problem,\u201d Advances in Computing Research: Parallel and Distributed Computing, vol. 4, JAI Press, 1987."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"G. Bracha, \u201cAn O(log n) Expected Rounds Randomized Byzantine Generals Algorithm,\u201d Proc. 17th Ann. ACM Symp. on Theory of Computing, pp. 316\u2013326, 1985.","DOI":"10.1145\/22145.22180"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, \u201cThe Distributed Firing Squad Problem,\u201d Proceedings of the 17th Ann. ACM Symp. on Theory of Computing, pp. 335\u2013345, May 1985.","DOI":"10.1145\/22145.22182"},{"key":"7_CR7","unstructured":"D. Dolev, private communication."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L. Stockmeyer, \u201cOn the Minimal Synchronism Needed for Distributed Consensus,\u201d J. ACM, vol. 34, no. 1, pp.77\u201397, Jan. 1987.","journal-title":"J. ACM"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0022-0000(86)90028-0","volume":"32","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, J. Halpern, and H. R. Strong, \u201cOn the Possibility and Impossibility of Achieving Clock Synchronization,\u201d Journal of Computer and System Sciences, vol. 32, no. 2, pp. 230\u2013250, 1986.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0890-5401(87)90031-9","volume":"72","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, J. Halpern, B. Simons, and H. R. Strong, \u201cA New Look at Fault-Tolerant Network Routing,\u201d Information and Computation, vol. 72, no. 3, pp. 180\u2013198, March 1987.","journal-title":"Information and Computation"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl, \u201cReaching Approximate Agreement in the Presence of Faults,\u201d J. ACM, vol. 33, no. 3, pp. 499\u2013516, July 1986.","journal-title":"J. ACM"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"C. Dwork, N. Lynch, and L. Stockmeyer, \u201cConsensus in the Presence of Partial Synchrony,\u201d J. ACM, vol. 35, no. 2, pp. 288\u2013323, 1988.","journal-title":"J. ACM"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"A. Fekete, \u201cAsynchronous Approximate Agreement,\u201d Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing, pp. 64\u201376, Aug. 1987.","DOI":"10.1145\/41840.41846"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M. Fischer","year":"1986","unstructured":"M. Fischer, N. Lynch, and M. Merritt, \u201cEasy Impossibility Proofs for Distributed Consensus Problems,\u201d Distributed Computing, vol.1, no.1, pp. 26\u201339, 1986.","journal-title":"Distributed Computing"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, and M. Paterson, \u201cImpossibility of Distributed Consensus with One Faulty Process,\u201d J. ACM, vol. 32, no. 2, pp. 374\u2013382, 1985.","journal-title":"J. ACM"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0885-064X(85)90010-X","volume":"1","author":"J. Halpern","year":"1985","unstructured":"J. Halpern, N. Megiddo and A. Munshi, \u201cOptimal Precision in the Presence of Uncertainty,\u201d Journal of Complexity, vol. 1, pp. 170\u2013196, 1985.","journal-title":"Journal of Complexity"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"J. Halpern, B. Simons, R. Strong, and D. Dolev, \u201cFault-Tolerant Clock Synchronization,\u201d Proc. 3rd Ann. ACM Symp. on Principles of Distributed Computing, pp. 89\u2013102, Aug. 1984.","DOI":"10.1145\/800222.806739"},{"issue":"7","key":"7_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"27","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \u201cTime, Clocks, and the Ordering of Events in a Distributed System,\u201d C. ACM, vol. 27, no. 7, pp. 558\u2013565, July, 1978.","journal-title":"C. ACM"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0376-5075(78)90045-4","volume":"2","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \u201cUsing Time Instead of Timeout for Fault-Tolerant Distributed Systems,\u201d Computer Networks, vol. 2, pp. 95\u2013114, 1978.","journal-title":"Computer Networks"},{"issue":"2\/3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","volume":"62","author":"J. Lundelius","year":"1984","unstructured":"J. Lundelius and N. Lynch, \u201cAn Upper and Lower Bound for Clock Synchronization,\u201d Information and Control, vol. 62, nos. 2\/3, pp. 190\u2013204, Aug.\/Sept. 1984.","journal-title":"Information and Control"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/2455.2457","volume":"32","author":"L. Lamport","year":"1985","unstructured":"L. Lamport and P. Melliar-Smith, \u201cSynchronizing Clocks in the Presence of Faults,\u201d J. ACM, vol. 32, no. 1, pp. 52\u201378, Jan. 1985.","journal-title":"J. ACM"},{"key":"7_CR22","unstructured":"K. Marzullo, Loosely-Coupled Distributed Services: A Distributed Time Service, Ph.D. Thesis, Stanford Univ., 1983."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"S. Mahaney and F. Schneider, \u201cInexact Agreement: Accuracy, Precision and Graceful Degradation,\u201d Proc. 4th Ann. ACM Symp. on Principles of Distributed Computing, pp. 237\u2013249, Aug. 1985.","DOI":"10.1145\/323596.323618"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"G. Neiger and S. Toueg, \u201cSubstituting for Real Time and Common Knowledge in Asynchronous Distributed Systems,\u201d Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing, pp. 281\u2013293, 1987.","DOI":"10.1145\/41840.41864"},{"key":"7_CR25","volume-title":"\u201cA Paradigm for Reliable Clock Synchronization,\u201d Proc. Advanced Seminar on Real-Time Local Area Networks","author":"F. Schneider","year":"1986","unstructured":"F. Schneider, \u201cA Paradigm for Reliable Clock Synchronization,\u201d Proc. Advanced Seminar on Real-Time Local Area Networks, Bandol, France, April 1986."},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/28869.28876","volume":"34","author":"T.K. Srikanth","year":"1987","unstructured":"T.K. Srikanth and S. Toueg, \u201cOptimal Clock Synchronization,\u201d J. ACM, vol. 34, no. 3, pp. 626\u2013645, July 1987.","journal-title":"J. ACM"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0890-5401(87)90029-0","volume":"74","author":"J. L. Welch","year":"1987","unstructured":"J. Lundelius Welch, \u201cSimulating Synchronous Processors,\u201d Information and Computation, vol. 74, no. 2, pp. 159\u2013171, Aug. 1987.","journal-title":"Information and Computation"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(88)90043-0","volume":"77","author":"J. L. Welch","year":"1988","unstructured":"J. Lundelius Welch and N. Lynch, \u201cA New Fault-Tolerant Algorithm for Clock Synchronization,\u201d Information and Computation, vol. 77, no. 1, pp. 1\u201336, April 1988.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Fault-Tolerant Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0042327.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:44:24Z","timestamp":1607550264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0042327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387973850"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0042327","relation":{},"subject":[]}}