Information Processing Letters
On concurrent programming
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Systems Architecture: the EUROMICRO Journal
On fairness notions in distributed systems I.4: a characterization of implementability
Information and Computation
A Discipline of Programming
Distributed Computing
Fairness and hyperfairness in multi-party interactions
Distributed Computing
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem
ACM SIGSOFT Software Engineering Notes
On the correctness issues in two-process mutual exclusion algorithms
ACM SIGSOFT Software Engineering Notes
Modeling fairness and starvation in concurrent systems
ACM SIGSOFT Software Engineering Notes
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On deadlocks and fairness in self-organizing resource-flow systems
ARCS'10 Proceedings of the 23rd international conference on Architecture of Computing Systems
| Hi-index | 0.00 |
Many different fairness notions are available in literature. One should choose the proper definition that match with the system under consideration. In this paper we consider two known fairness definitions, viz., weak fairness and strong fairness. It is argued that these concepts are suitable for determining the degree of fairness of a given system. For only starvation freedom we require a minimum degree of fairness which we call least fairness. This idea is illustrated using two practical examples. Conspiracy is another very important issue in concurrent system. We have defined conspiracy in connection with all the fairness notions. Conspiracy resistant implementation is illustrated using a starvation free solution to dining philosophers problem. Dijkstra's weakest precondition calculus is used as the analytical tool.