Title
Self-stabilizing l-exclusion
Abstract
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. Copyright 2001 Elsevier Science B.V.
Year
DOI
Venue
1997
10.1016/S0304-3975(00)00325-X
Theoretical Computer Science
Keywords
DocType
Volume
elsevier science b.v.,self-stabilizing l-exclusion,processes crash,shared memory,correct behavior,single-writer multiple-reader regular register,self-stabilizing solution,mutual-exclusion problem,l-exclusion problem,transient failure,critical section
Conference
266
Issue
Citations 
PageRank 
1-2
8
0.54
References 
Authors
17
4
Name
Order
Citations
PageRank
Uri Abraham15613.91
Shlomi Dolev22962260.61
Ted Herman381860.12
Irit Koll480.54