Self-stabilizing strong fairness under weak fairness

Fairness assumptions have a great impact on distributed algorithms. They play a major role in determining the time complexity and the correctness of algorithms, since progress or freedom from various types of starvation may not be guaranteed without fairness assumptions. In this paper, we present a stabilizing deterministic algorithm allowing simultaneous execution of actions for strong fairness under weak fairness assumption, in addition, we show that the proposed algorithm yields a high degree of concurrency. We conclude the paper with some remarks on issues such as time optimal implementation of strong fairness and open problems related to fairness.