Appraising fairness in distributed languages

  • Authors:

  • K. R. Apt;N. Francez;S. Katz

  • Affiliations:

  • LITP, Universite Paris 7, 2, Place Jussieu, 75251 Paris, France and Laboratoire d'Informatique, Ecole Normale Superieure, 45, Rue d'Ulm, 75230 Paris, France;Department of Computer Science, The Technion- Israel Institute of Technology, Haifa, Israel;Department of Computer Science, The Technion- Israel Institute of Technology, Haifa, Israel

  • Venue:
  • POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Natural semantic criteria are presented which an acceptable notion of fairness should satisfy. These are then used to demonstrate differences among the basic models, the added power of the fairness notion, and the sensitivity of the fairness notion to irrelevant semantic interleavings of independent operations. These results are used to show that from the considerable variety of commonly used possibilities, only strong process fairness is appropriate for CSP if these criteria are adopted. We also show that under these criteria, none of the commonly used notions of fairness are fully acceptable for a model with an n-way synchronization mechanism. Finally, the notion of fairness most often mentioned for Ada is shown to be fully acceptable.