Fairness of N-party synchronization and its implementation in a distributed environment

  • Cheng Wu
  • Gregor v. Bochmann
  • Mingyu Yao
Miscellaneous

DOI: 10.1007/3-540-57271-6_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 725)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Cheng Wu
    • 1
  • Gregor v. Bochmann
    • 1
  • Mingyu Yao
    • 1
  1. 1.Departement d'informatique et de recherche operationnelleUniversite de MontrealMontrealCanada

Personalised recommendations