Abstract
In this paper, a new fairness notion is proposed for languages with multi-party interactions as the sole interprocess synchronization and communication primitive. The main advantage of this fairness notion is the elimination of starvation occurring solely due to race conditions (i.e., ordering of independent actions). Also, this is the first fairness notion for such languages which is fully adequate with respect to the criteria presented in [2]. The paper defines the notion, proves its properties, and presents examples of its usefulness.
Original language | English (US) |
---|---|
Pages (from-to) | 245-254 |
Number of pages | 10 |
Journal | Distributed Computing |
Volume | 6 |
Issue number | 4 |
DOIs | |
State | Published - Jul 1993 |
Externally published | Yes |
Keywords
- Fairness
- Hyperfairness
- Multi-party interaction
- Starvation
- Synchronization
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics