Abstract
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At implementation level, the question becomes how to implement the underlying fairness which is assumed to be true at the specification level. In this paper, we study four types of fairness, the so-called w-fairness (weak fairness), s-fairness (strong fairness), u-fairness and su-fairness, in the context of the design of N-party synchronization algorithms. Within an abstract model for distributed systems, we formally introduce the four fairness concepts. We formally present, in the form of extended finite state machines, several distributed N-party synchronization algorithms which satisfy different fairness properties. The algorithms given in this paper are abstract in a sense that they are not optimized. The abstraction makes the construction of the algorithms and their proof of correctness easier.
This work was performed within the IDACOM-NSERC-CWARC Industrial Research Chair on Communication Protocols and was also supported by the Ministry of Education of Quebec.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. C. Attie, I. R. Forman and E. Levy, On Fairness as an abstraction for the design of distributed systems, Proc. of The 10th International Conference on Distributed Computing Systems, Paris, France, 1990.
R.J.R. Back and R. Kurki-Suonio, Serializability in distributed systems with handshaking, in Proc. 15th ICALP, Tampere, LNCS 317, pages 52–66, Springer-Verlag, Juillly 1988.
A. Charlesworth, The Multi-way Rendezvous, ACM Tran. on Programming Languages and Systems, Vol. 9, No. 2, July 1987, pp. 350–366.
N. Francez, Fairness, Springer-Verag New York, 1986.
Q. Gao and G. v. Bochmann, Distributed Implementation of LOTOS Multiple-Rendezvous, participant proceeding of The 9th International Symposium of Protocol Specification, Testing, and Verification, Enschede, The Netherlands, 1989.
ISO, LOTOS: a formal description technique, IS8807, 1989.
R. Kuiper and W. P. d. Roever, Fairness assumptions for CSP in a temporal logic framework, Proc. of TC.2 Working Conference on the Formal Description of Programming Concepts, Garmisch Partenkirchen, North Holland, 1983.
D. Kumar, An implementation of N-way Synchronization Using Tokens, Proc. of The 10th International Conference on Distributed Computing Systems, Paris France, 1990.
J. Parrow, Fairness properties in process algebra, (Ph.D. thesis) Dept. of computer Systems, Uppsala University, Uppsala, Sweden, 1985.
A. Pnueli, The Temporal Semantics of Concurrent Programs, LNCS 70, Springer-Verlag, 1979, pp. 1–20.
S. Ramesh, A New and Efficient Implementation of Multiprocesses Synchronization, Proc. of PARLE, Eindhoven, 1987.
Yih-Kuen Tsay, Rajive L.Bagrodia, “Some Impossibility Results in Interprocess Synchronization”, Technical report CSD-890059, Computer Science Department, UCLA, 1989
C. Wu and G. v. Bochmann, Fairness in LOTOS, FORTE'91, Sydney, Nov. 19–21, 1991.
C. Wu, G. V. Bochmann, and Minyu Yao, Fairness of N-party Synchronization and Its Implementation in a Distributed Environment, No. 797, Dept. I.R.O., Universite de Montreal, Nov. 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, C., v. Bochmann, G., Yao, M. (1993). Fairness of N-party synchronization and its implementation in a distributed environment. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_42
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive