Proving Properties of Dekker’s Algorithm for Mutual Exclusion of N Processes
Dekker’s algorithm for mutual exclusion of two processes is the well-known first developed correct solution based only on software mechanisms. The algorithm served as the starting point for researchers to create subsequent safe solutions both for two and N > 2 processes. In recent years, Dekker p...
Saved in:
| Main Authors: | Libero Nigro, Franco Cicirelli |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/18/4/226 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The landscape of human mutually exclusive splicing
by: Klas Hatje, et al.
Published: (2017-12-01) -
A mutual exclusion key pairing scheme for preserving the privacy of channel shared 5G users
by: Meshari D. Alanazi, et al.
Published: (2025-06-01) -
Q-LME: Q-learning-based local mutual exclusion algorithm for flying ad hoc networks
by: Sindhuja S, et al.
Published: (2025-07-01) -
Optimal nodes selection in wireless sensor and actor networks based on prioritized mutual exclusion approach
by: VIRENDER RANGA, et al.
Published: (2016-02-01) -
Halving interval guaranteed for Dekker and Brent root finding methods
by: Vilmar Steffen, et al.
Published: (2025-06-01)