Consistency requirements of distributed shared memory for Dijkstra's mutual exclusion algorithm

2002 ◽  
Author(s):  
J. Brzezinski ◽  
D. Wawrzyniak
Keyword(s):  
Shared Memory ◽  
Mutual Exclusion ◽  
Distributed Shared Memory ◽  
Mutual Exclusion Algorithm

Modelling Peterson Mutual Exclusion Algorithm in DVE Language and Verifying LTL Properties

2014 ◽  
Vol 577 ◽  
pp. 1012-1016
Author(s):  
Shi Gong Long ◽  
Han Wen Yang
Keyword(s):  
Shared Memory ◽  
Mutual Exclusion ◽  
Concurrent Programming ◽  
Specification Language ◽  
Experimental Results ◽  
Programming Algorithm ◽  
Model Checker ◽  
Single Use ◽  
Mutual Exclusion Algorithm

Peterson mutual exclusion algorithm is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication. DiVinE is a LTL model checker, and DVE is the specification language. In this paper, we implement the DVE model of Peterson mutual exclusion algorithm, and verify LTL properties of Peterson mutual exclusion algorithms using DiVinE model checker. The experimental results show that the LTL formula structure is relevant to the costs of LTL verification.

SPEEDUP OF THE n-PROCESS MUTUAL EXCLUSION ALGORITHM

1999 ◽  
Vol 09 (04) ◽  
pp. 475-485 ◽  
Author(s):  
YOSHIHIDE IGARASHI ◽  
YASUAKI NISHITANI
Keyword(s):  
Shared Memory ◽  
Upper Bound ◽  
Critical Region ◽  
Mutual Exclusion ◽  
Memory Model ◽  
Running Time ◽  
Speed Up ◽  
Mutual Exclusion Algorithm ◽  
Modified Algorithm

We propose two modifications of the n-process mutual exclusion algorithm by Peterson for the asynchronous multi-writer/reader shared memory model. By any of the modifications we can speed up the original n-process algorithm. The running times for the trying regions of the first modified algorithm and the second modified algorithm are (2n - 3)c + O(n3 l) and (n - 1)c + O(n3 l), respectively, where n is the number of processes, l is an upper bound on the time between two steps, and c is an upper bound on the time that any user spends in the critical region. These running times are improvements on the running time, O(n2c + n4 l) of the original n-process algorithm for the same asynchronous shared memory model.

Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM

2021 ◽  
Vol 8 (4) ◽  
pp. 1-26
Author(s):  
Prasad Jayanti ◽  
Siddhartha Jayanti
Keyword(s):  
Shared Memory ◽  
State Of The Art ◽  
Mutual Exclusion ◽  
Distributed Shared Memory ◽  
Deterministic Algorithm ◽  
Remote Memory ◽  
Worst Case ◽  
Memory Reference ◽  
Time Systems ◽  
Fairness Condition

The abortable mutual exclusion problem, proposed by Scott and Scherer in response to the needs in real-time systems and databases, is a variant of mutual exclusion that allows processes to abort from their attempt to acquire the lock. Worst-case constant remote memory reference algorithms for mutual exclusion using hardware instructions such as Fetch&Add or Fetch&Store have long existed for both cache coherent (CC) and distributed shared memory multiprocessors, but no such algorithms are known for abortable mutual exclusion. Even relaxing the worst-case requirement to amortized, algorithms are only known for the CC model. In this article, we improve this state of the art by designing a deterministic algorithm that uses Fetch&Store to achieve amortized O (1) remote memory reference in both the CC and distributed shared memory models. Our algorithm supports Fast Abort (a process aborts within six steps of receiving the abort signal) and has the following additional desirable properties: it supports an arbitrary number of processes of arbitrary names, requires only O (1) space per process, and satisfies a novel fairness condition that we call Airline FCFS . Our algorithm is short with fewer than a dozen lines of code.

A Distributed Shared Memory Middleware for Speculative Parallel Discrete Event Simulation

2020 ◽  
Vol 30 (2) ◽  
pp. 1-26 ◽  
Author(s):  
Matteo Principe ◽  
Tommaso Tocci ◽  
Pierangelo Di Sanzo ◽  
Francesco Quaglia ◽  
Alessandro Pellegrini
Keyword(s):  
Shared Memory ◽  
Discrete Event Simulation ◽  
Discrete Event ◽  
Distributed Shared Memory ◽  
Parallel Discrete Event Simulation ◽  
Event Simulation ◽  
Parallel Discrete Event
Sign in / Sign up

Export Citation Format

Share Document