Talks and Poster Presentations (with Proceedings-Entry):
P. Robinson, U. Schmid:
"The Asynchronous Bounded Cycle Model";
Talk: 10 International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2008),
- 2008-11-23; in: "Stabilization, Safety, and Security of Distributed Systems",
Lecture Notes in Conputer Science / Springer Verlag,
s paper shows how synchrony conditions can be added to the purely asynchronous model in a way that avoids any reference to message delays and computing step times, as well as any global constraints on communication patterns and network topology. Our Asynchronous Bounded-Cycle (ABC) model just bounds the ratio of the number of forward- and backward-oriented messages in certain ("relevant") cycles in the space-time diagram of an asynchronous execution. 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. We also prove that any algorithm working correctly in the partially synchronous Θ-Model also works correctly in the ABC model. Finally, we relate our model to the classic partially synchronous model, and discuss aspects of its applicability in real systems.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.