Self-stabilizing K-out-of-L exclusion on tree network

2008/12/05 by Ajoy Datta, Ajoy K. Datta, Stéphane Devismes +6
Computer Science · #Advanced Data Storage Technologies #Distributed systems and fault tolerance #Parallel Computing and Optimization Techniques #cs.NI

paper · pdf · doi:10.48550/arxiv.0812.1093

15 pages

arxiv created 2009/02/13 · arxiv updated 2009/12/01

Abstract

In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are ℓ units of a shared resource, and any process can request up to \mathtt k units (1≤\mathtt k≤ℓ). We propose the first deterministic self-stabilizing distributed K-out-of-L exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.

Related

• Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message\n Passing Systems
• An asynchronous message-passing distributed algorithm for the global critical section problem
• On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks
• Deterministic Self-Stabilizing BFS Construction in Constant Space
• Partial mutual exclusion for infinitely many processes