Some impossibility results in interprocess synchronization

  • Authors:

  • Yih-Kuen Tsay;Rajive L. Bagrodia

  • Affiliations:

  • Computer Science Department, University of California at Los Angeles, 3531 Boelter Hall, Los Angeles, CA;Computer Science Department, University of California at Los Angeles, 3531 Boelter Hall, Los Angeles, CA

  • Venue:
  • Distributed Computing
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we construct a formal specification of the problem of synchronizing asynchronous processes under strong fairness. We prove that strong interaction fairness is impossible for binary (and hence for multiway) interactions and strong process fairness is impossible for multiway interactions.