The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
ISTCS'92 Symposium proceedings on Theory of computing and systems
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On interprocess communication and the implementation of multi-writer atomic registers
Theoretical Computer Science
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Self-stabilization
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Distributed Algorithms
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Self-stabilizing multi-token rings
Distributed Computing
Distributed Computing
Space and time efficient self-stabilizing l-exclusion in tree networks
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Theoretical Computer Science
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Safety assurance via on-line monitoring
Distributed Computing
| Hi-index | 5.23 |
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.