skip to main content
10.1145/1400751.1400815acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

The asynchronous bounded-cycle model

Published: 18 August 2008 Publication History

Abstract

In this paper, we introduce the Asynchronous Bounded-Cycle (ABC) model, which considerably relaxes the Theta-Model proposed by Le Lann and Schmid. The ABC model just bounds the ratio of the number of forward and backward messages in certain cycles in the space-time diagram of an asynchronous execution. It hence avoids any reference to end-to-end delays, allows individual messages to have arbitrary delays, and does not involve global synchrony conditions. We show that clock synchronization and lock-step rounds can easily be implemented and proved correct in the ABC model, even in the presence of Byzantine failures. Moreover, we show that any correct Theta-algorithm also works correctly in the ABC model. Our proof is based on a novel technique for assigning message delays to asynchronous executions, which is of independent interest.

References

[1]
M. Fuegger, U. Schmid, G. Fuchs, and G. Kempf. Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip. In Proceedings EDCC-6, pages 87--96, Oct. 2006.
[2]
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558--565, 1978.
[3]
P. Robinson and U. Schmid. The Asynchronous Bounded-Cycle Model. Research Report 24/2008, Technische Universitaet Wien.
[4]
J. Widder, G. Le Lann, and U. Schmid. Failure detection with booting in partially synchronous systems. Proceedings EDCC-5, Springer LNCS 3463, pages 20--37, Apr. 2005.

Cited By

View all
  • (2015)A Failure Detector for k-Set Agreement in Dynamic Systems2015 IEEE 14th International Symposium on Network Computing and Applications10.1109/NCA.2015.45(176-183)Online publication date: Sep-2015
  • (2010)Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed SystemsSynthesis Lectures on Distributed Computing Theory10.2200/S00236ED1V01Y201004DCT0021:1(1-273)Online publication date: Jan-2010
  • (2009)Optimal message-driven implementations of omega with mute processesACM Transactions on Autonomous and Adaptive Systems10.1145/1462187.14621914:1(1-22)Online publication date: 9-Feb-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
August 2008
474 pages
ISBN:9781595939890
DOI:10.1145/1400751
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: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. fault-tolerant distributed algorithms
  2. lock-step round simulation
  3. partially synchronous system models
  4. vlsi

Qualifiers

  • Demonstration

Conference

PODC '08

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2015)A Failure Detector for k-Set Agreement in Dynamic Systems2015 IEEE 14th International Symposium on Network Computing and Applications10.1109/NCA.2015.45(176-183)Online publication date: Sep-2015
  • (2010)Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed SystemsSynthesis Lectures on Distributed Computing Theory10.2200/S00236ED1V01Y201004DCT0021:1(1-273)Online publication date: Jan-2010
  • (2009)Optimal message-driven implementations of omega with mute processesACM Transactions on Autonomous and Adaptive Systems10.1145/1462187.14621914:1(1-22)Online publication date: 9-Feb-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media