.png){kind=icon}
Return
A self-stabilizing algorithm for strong fairness
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02684333.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Self-stabilization is a novel technique to deal with faults in distributed systems. This paper presents a distributed self-stabilizing algorithm for implementing strong fairness in an arbitrary network A desirable feature of this algorithm is that it can be used to enforce the strong fairness property on any distributed algorithm including self-stabilizing algorithms. In addition, the algorithm does not require any initialization and can withstand transient failures. At the end of the paper such issues as improving the time complexity of the proposed algorithm and the limitations on the efficiency of any implementation of strong fairness are discussed.
Keywords:
distributed systems
fairness
self-stabilization
strong fairness
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveMidichloria mitochondriiis widespread in hard ticks (Ixodidae) and resides in the mitochondria of phylogenetically diverse species.png)
Parasitology
ParasitologyIF0
PREAI
ShareSaveShareSaveShareSave no more
no more