Self-stabilizing l-exclusion

Theoretical Computer Science

Volumn 266, Issue 1-2, 2001, Pages 653-692

  Abraham, Uri ^a   Dolev, Shlomi ^a   Herman, Ted ^b   Koll, Irit ^a,c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b University of Iowa   (United States)

^c Elta   (Israel)

Author keywords

Communication registers; Mutual exclusion; Resource allocation; Self stabilization

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

COMMUNICATION REGISTERS;

COMPUTER SCIENCE;

EID: 0035817807     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00325-X     Document Type: Article

References (29)

1. On interprocess communication and the implementation of multi-writer atomic registers
2. Self-stabilizing l-exclusion
3. A bounded first-in, first-enabled solution to the l-exclusion problem
4. Solution of a problem in concurrent programming control
5. Self-stabilizing systems in spite of distributed control
6. Self stabilization of dynamic systems assuming only read/write atomicity
7. Bounded concurrent time-stamping
8. Time lapse snapshots
9. Self-stabilizing multi-token rings
10. Resource allocation with immunity to limited process failure
11. Distributed FIFO allocation of identical resources using small shared space
12. Bounded time stamps
13. Bounded time stamps
14. A new solution of Dijkstra's concurrent programming problem
15. The mutual exclusion problem. Part II: Statement and solutions
16. On interprocess communication (Parts I and II)
17. A first-come-first-served mutual-exclusion algorithm with small communication variables
18. Myths about the mutual exclusion problem
19. Economical solutions for the critical section problem in distributed systems
20. A contribution to the theory of relative position