Abstract
We study a special type of self-stabilizing algorithms composition: the cross-over composition (A⋄B). The cross-over composition is the generalization of the algorithm compiler idea introduced in [3]. The cross-over composition could be seen as a black box with two entries and one exit. The composition goal is to improve the qualities of the first algorithm A, using as medium the second algorithm B. Informally, the obtained algorithm is A after the transfer of B’s properties. Here, we provide a complete analysis of the composition, when the algorithms (A and B) are deterministic and/or probabilistic algorithms. Moreover, we show that the cross-over composition is a powerful tool in order to enforce a scheduler to have a fair behavior regarding to A.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beauquier J., Datta A., Gradinariu M., and Magniette F.: Self-stabilizing Local Mutual Exclusion and Daemon Refinement. DISC 2000, 14th International Symposium on Distributed Computing, LNCS:1914 (2000) 223–237
Beauquier J., Durand-Lose J., Gradinariu M., Johnen C.: Token based selfstabilizing uniform algorithms. tech. Rep. no. 1250, LRI, Université Paris-Sud; to appear in The Chicago Journal of Theoretical Computer Science (2000)
Beauquier J., Gradinariu M., Johnen C.: Memory Space Requirements for Selfstabilizing Leader Election Protocols. PODC’99, 18th Annual ACM Symposium on Principles of Distributed Computing (1999) 199–208
Beauquier J., Gradinariu M., Johnen C.: Randomized self-stabilizing optimal leader election under arbitrary scheduler on rings. Tech. Rep. no. 1225, LRI, Université Paris-Sud (1999)
Dolev S., Herman T.: Parallel composition of stabilizing algorithms. WSS’99, fourth Workshop on Self-Stabilizing Systems (1999) 25–32
Fich F., Johnen C., A space optimal deterministic, self-stabilizing, leader election algorithm for unidirectional Rings. DISC 2001, 15th International Symposium on Distributed Computing (2001)
Gouda M., Haddix F.: The alternator. WSS’99, Fourth Workshop on Self-Stabilizing Systems (1999) 48–53
Gouda M., Herman T.: Adaptive programming. IEEE Transactions on Software Engineering 17 (1991) 911–921
Kakugawa, H., Yamashita, M.: Uniform and Self-stabilizing Token Rings Allowing Unfair Daemon. IEEE Transactions on Parallel and Distributed Systems 8 (1997) 154–162
Segala R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, MIT, Department of Electrical Engineering and Computer Science (1995)
Segala R., Lynch N.: Probabilistic simulations for probabilistic processes. CONCUR’94, 5th International Conference on Concurrency Theory, LNCS:836, (1994)
Varghese G.: Compositional proofs of self-stabilizing protocols. WSS’97, Third Workshop on Self-stabilizing Systems (1997) 80–94
Wu S. H., Smolka S. A., Stark E. W.: Composition and behaviors of probabilistic I/O automata. CONCUR’94, 5th International Conference on Concurrency Theory, LNCS:836, (1994) 513–528
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, J., Gradinariu, M., Johnen, C. (2001). Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-45438-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42653-0
Online ISBN: 978-3-540-45438-0
eBook Packages: Springer Book Archive