Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800222.806739acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article
Free access

Fault-tolerant clock synchronization

Published: 27 August 1984 Publication History

Abstract

This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. The algorithms tolerate both link and node failures of any type. The algorithm for maintaining synchronization will work for arbitrary networks (rather than just completely connected networks) and tolerates any number of processor or communication link faults as long as the correct processors remain connected by fault-free paths. It thus represents an improvement over other clock synchronization algorithms such as [LM1,LM2,LL1]. Our algorithm for allowing new processors to join requires that more than half the processors be correct, a requirement which is provably necessary.

References

[1]
D. Dolev, J. Y. Halpern, B. B. Simons, and H. R. Strong, A new look at fault tolerant network routing, Proceedings of the Sixteenth Annual ACM STOC, 1984, pp. 526-535; also IBM RJ4239, 1984.
[2]
D. Dolev, J. Y. Halpern, and H. R. Strong, On the possibility and impossibility of achieving clock synchronization, Proceedings of the Sixteenth Annual ACM STOC, 1984, pp. 504-511; also IBM RJ4218, 1984.
[3]
D.Dolev and H. R. Strong, Authenticated algorithms for Byzantine agreement, SIAM J. of Computing, 12:4, 1983, pp. 656-666.
[4]
J.Y. Halpern, B. B. Simons, and H. R. Strong, An efficient fault-tolerant algorithm for clock synchronization, IBM RJ4094, 1983.
[5]
L. Lamport and P. M. Melliar-Smith, Synchronizing clocks in the presence of faults, SRI International Report, 1982.
[6]
L. Lamport and P. M. Melliar-Smith, Byzantine clock synchronization, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, 1983.
[7]
J. Lundelius and N. Lynch, A new fault-tolerant algorithm for clock synchronization, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, 1983.
[8]
J. Lundelius and N. Lynch, An upper lower bound for clock synchronization, unpublished manuscript, 1984.
[9]
K. Marzullo, Loosely-coupled distributed services: a distributed time system, Ph.D. dissertation, Stanford University, 1983.
[10]
R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21:2, 1978, pp. 120-126.

Cited By

View all
  • (2023)Multidimensional Approximate Agreement with Asynchronous FallbackProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591105(141-151)Online publication date: 17-Jun-2023
  • (2023)Data Provenance for IoT Devices by Exploiting Clock Variations2023 IEEE Conference on Dependable and Secure Computing (DSC)10.1109/DSC61021.2023.10378963(1-8)Online publication date: 7-Nov-2023
  • (2022)Optimal Clock Synchronization with SignaturesProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538444(440-449)Online publication date: 20-Jul-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '84: Proceedings of the third annual ACM symposium on Principles of distributed computing
August 1984
301 pages
ISBN:0897911431
DOI:10.1145/800222
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 1984

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)56
  • Downloads (Last 6 weeks)10
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Multidimensional Approximate Agreement with Asynchronous FallbackProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591105(141-151)Online publication date: 17-Jun-2023
  • (2023)Data Provenance for IoT Devices by Exploiting Clock Variations2023 IEEE Conference on Dependable and Secure Computing (DSC)10.1109/DSC61021.2023.10378963(1-8)Online publication date: 7-Nov-2023
  • (2022)Optimal Clock Synchronization with SignaturesProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538444(440-449)Online publication date: 20-Jul-2022
  • (2022)Optimal Synchronous Approximate Agreement with Asynchronous FallbackProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538442(70-80)Online publication date: 20-Jul-2022
  • (2022)Event Reference Synchronization (ERS): An Event-Based IoT Clock Synchronization2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)10.1109/PIMRC54779.2022.9977569(1250-1256)Online publication date: 12-Sep-2022
  • (2022)Permissionless Clock Synchronization with Public SetupTheory of Cryptography10.1007/978-3-031-22368-6_7(181-211)Online publication date: 21-Dec-2022
  • (2021)Clock synchronization in distributed multicomputer systems. Part IIEngineering Journal: Science and Innovation10.18698/2308-6033-2021-5-2081Online publication date: May-2021
  • (2021)Clock synchronization in distributed multicomputer systems. Part IEngineering Journal: Science and Innovation10.18698/2308-6033-2021-4-2074Online publication date: Apr-2021
  • (2021)Reaching self-stabilising distributed synchronisation with COTS Ethernet components: the WALDEN approachReal-Time Systems10.1007/s11241-020-09356-xOnline publication date: 2-Jan-2021
  • (2021)Dynamic Ad Hoc Clock SynchronizationAdvances in Cryptology – EUROCRYPT 202110.1007/978-3-030-77883-5_14(399-428)Online publication date: 16-Jun-2021
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media