Two Mutual Exclusion Algorithms for Shared Memory

03/25/2019
by   Jordi Bataller Mascarell, et al.
0

In this paper, we introduce two algorithms that solve the mutual exclusion problem for concurrent processes that communicate through shared variables, [2]. Our algorithms guarantee that any process trying to enter the critical section, eventually, does enter it. They are formally proven to be correct. The first algorithm uses a special coordinator process in order to ensure equal chances to processes waiting for the critical section. In the second algorithm, with no coordinator, the process exiting the critical section is in charge to fairly elect the following one. In the case that no process is waiting, the turn is marked free and will be determined by future waiting processes. The type of shared variables used are a turn variable, readable and writable by all processes; and a flag array, readable by all with flag[i] writable only by process i. There is a version of the first algorithm where no writable by all variable is used. The bibliography reviewed for this paper is [4] and [3], all the rest is original work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results

In an anonymous shared memory system, all inter-process communications a...
research
05/13/2018

Fast and Scalable Group Mutual Exclusion

The group mutual exclusion (GME) problem is a generalization of the clas...
research
03/07/2019

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)

Local mutual exclusion guarantees that no two neighboring processes ente...
research
04/03/2019

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines

In light of recent advances in non-volatile main memory technology, Gola...
research
11/03/2021

Fair Mutual Exclusion for N Processes (extended version)

Peterson's mutual exclusion algorithm for two processes has been general...
research
10/08/2018

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion

The notion of an anonymous shared memory (recently introduced in PODC 20...
research
10/15/2021

Adaptive and Fair Transformation for Recoverable Mutual Exclusion

Mutual exclusion is one of the most commonly used techniques to handle c...

Please sign up or login with your details

Forgot password? Click here to reset