10 research outputs found
An asynchronous message-passing distributed algorithm for the global critical section problem
This paper considers the global -CS problem which is the problem of
controlling the system in such a way that, at least and at most
processes must be in the CS at a time in the network. In this paper, a
distributed solution is proposed in the asynchronous message-passing model. Our
solution is a versatile composition method of algorithms for -mutual
inclusion and -mutual exclusion. Its message complexity is , where
is the maximum size for the quorum of a coterie used by the algorithm,
which is typically .Comment: This is a modified version of the conference paper in PDAA201
Self-stabilizing K-out-of-L exclusion on tree network
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 units
(). 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.Comment: 15 page
RGLock: Recoverable Mutual Exclusion for Non-Volatile Main Memory Systems
Mutex locks have traditionally been the most popular concurrent programming mechanisms for inter-process synchronization in the rapidly advancing field of concurrent computing systems that support high-performance applications. However, the concept of recoverability of these algorithms in the event of a crash failure has not been studied thoroughly. Popular techniques like transaction roll-back are widely known for providing fault-tolerance in modern Database Management Systems. Whereas in the context of mutual exclusion in shared memory systems, none of the prominent lock algorithms (e.g., Lamport’s Bakery algorithm, MCS lock, etc.) are designed to tolerate crash failures, especially in operations carried out in the critical sections. Each of these algorithms may fail to maintain mutual exclusion, or sacrifice some of the liveness guarantees in presence of crash failures. Storing application data and recovery information in the primary storage with conventional volatile memory limits the development of efficient crash-recovery mechanisms since a failure on any component in the system causes a loss of program data. With the advent of Non-Volatile Main Memory technologies, opportunities have opened up to redefine the problem of Mutual Exclusion in the context of a crash-recovery model where processes may recover from crash failures and resume execution. When the main memory is non-volatile, an application’s entire state can be recovered from a crash using the in-memory state near-instantaneously, making a process’s failure appear as a suspend/resume event. This thesis proceeds to envision a solution for the problem of mutual exclusion in such systems. The goal is to provide a first-of-its-kind mutex lock that guarantees mutual exclusion and starvation freedom in emerging shared-memory architectures that incorporate non-volatile main memory (NVMM)
Self-Stabilizing l-Exclusion
This work presents a self-stabilizing algorithm for the problem of l-exclusion using regular registers. The algorithm is designed for weak communication primitives: processes communicate using single-writer, multi-reader regular registers. In addition to the consideration of transient failures leading to an unpredictable initial state, process crashes are also tolerated. The algorithm is a combination of mechanisms that are responsible for safety and fairness