Abstract
A distributed system consists of processes linked to one another by communication links. A classical problem is how to realistically model these links so that it is possible to write correct algorithms. This paper presents a new solution that results in more natural executions and removes the need for artificial workarounds.
A more detailed version appears as a technical report [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Afek, Y., Bremler, A.: Self-stabilizing unidirectional network algorithms by power-supply. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 111–120 (1997)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Peres, O.: How to overcome the limits of bounds. Technical Report 0908, Ben-Gurion University of the Negev (August 2009)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peres, O. (2009). Brief Announcement: How to Overcome the Limits of Bounds. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-05118-0_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05117-3
Online ISBN: 978-3-642-05118-0
eBook Packages: Computer ScienceComputer Science (R0)