TY - JOUR
T1 - Self-stabilizing l-exclusion
AU - Abraham, Uri
AU - Dolev, Shlomi
AU - Herman, Ted
AU - Koll, Irit
N1 - Funding Information:
E-mail addresses:[email protected] (U. Abraham), [email protected] (S. Dolev), [email protected]. edu (T. Herman), [email protected] (I. Koll). 1Partially supported by the Israeli ministry of science and arts grant #6756195. 2This work is supported by NSF CAREER award CCR-9733541.
PY - 2001/9/6
Y1 - 2001/9/6
N2 - Our work presents a self-stabilizing solution to the l-exclusion problem. This problem is a well-known generalization of the mutual-exclusion problem in which up to l, but never more than l, processes are allowed simultaneously in their critical sections. Self-stabilization means that even when transient failures occur and some processes crash, the system finally resumes its regular and correct behavior. The model of communication assumed here is that of shared memory, in which processes use single-writer multiple-reader regular registers.
AB - Our work presents a self-stabilizing solution to the l-exclusion problem. This problem is a well-known generalization of the mutual-exclusion problem in which up to l, but never more than l, processes are allowed simultaneously in their critical sections. Self-stabilization means that even when transient failures occur and some processes crash, the system finally resumes its regular and correct behavior. The model of communication assumed here is that of shared memory, in which processes use single-writer multiple-reader regular registers.
KW - Communication registers
KW - Mutual exclusion
KW - Resource allocation
KW - Self-stabilization
UR - http://www.scopus.com/inward/record.url?scp=0035817807&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(00)00325-X
DO - 10.1016/S0304-3975(00)00325-X
M3 - Article
AN - SCOPUS:0035817807
SN - 0304-3975
VL - 266
SP - 653
EP - 692
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -