Results 11 to 20 of about 61,822 (267)
Verifying Mutual Exclusion Algorithms with Non-Atomic Registers
The work described in this paper develops a formal method for modeling and exhaustive verification of mutual exclusion algorithms. The process is based on timed automata and the Uppaal model checker.
Libero Nigro
doaj +3 more sources
Modeling and Analysis of Dekker-Based Mutual Exclusion Algorithms
Mutual exclusion is a fundamental problem in concurrent/parallel/distributed systems. The first pure-software solution to this problem for two processes, which is not based on hardware instructions like test-and-set, was proposed in 1965 by Th.J.
Libero Nigro +2 more
doaj +3 more sources
Correctness Verification of Mutual Exclusion Algorithms by Model Checking
Mutual exclusion algorithms are at the heart of concurrent/parallel and distributed systems. It is well known that such algorithms are very difficult to analyze, and in the literature, different conjectures about starvation freedom and the number of by ...
Libero Nigro, Franco Cicirelli
doaj +3 more sources
Formal Modeling and Verification of Lycklama and Hadzilacos’s Mutual Exclusion Algorithm
This study describes our thorough experience of formal modeling and exhaustive verification of concurrent systems, particularly mutual exclusion algorithms. The experience focuses on Lycklama and Hadzilacos’s (LH) mutual exclusion algorithm.
Libero Nigro
doaj +3 more sources
Hierarchical token based mutual exclusion algorithms [PDF]
Mutual exclusion is a basic block of distributed synchronization algorithms. One of the challenge in highly distributed environments (like peer-to-peer or Grid configurations) is to provide scalable synchronizations taking into account the hierarchical network topology. This paper proposes hierarchical mutual exclusion algorithms.
Bertier, Marin +2 more
openaire +3 more sources
Model Checking Mutual Inclusion and Mutual Exclusion Algorithms
The concepts of mutual inclusion and mutual exclusion are critical for concurrency control in distributed systems. Mutual exclusion is a property which ensures that at most one process can execute in its critical section at any given time. For example, other processes are not allowed to enter their critical sections when a given process is updating a ...
Kai Zhao +2 more
openaire +2 more sources
High‐contention mutual exclusion by elevator algorithms [PDF]
SummaryThis paper presents new starvation‐free hardware‐assisted and software‐only algorithms for the N‐thread mutual‐exclusion problem. The hardware‐assisted versions use a single atomic‐CAS instruction and no fences. The software‐only algorithms simulate the CAS instruction using a variation of Burns‐Lamport (1 fence) or Lamport's fast algorithm (3 ...
Peter A. Buhr +2 more
openaire +1 more source
Dekker's mutual exclusion algorithm made RW‐safe [PDF]
SummaryDekker's algorithm was thought to be safe in an environment without atomic reads or writes where bits flicker or scramble during simultaneous operations. A counter‐example is presented showing Dekker's algorithm is unsafe without atomic read. A modification to the original algorithm is presented making it RW‐safe, allowing threaded systems to be
Buhr, Peter A. +2 more
openaire +2 more sources
Algon: a framework for supporting comparison of distributed algorithm performance [PDF]
Programmers often need to use distributed algorithms to add non-functional behaviour such as mutual exclusion, deadlock detection and termination, to a distributed application.
Bishop, J. +4 more
core +1 more source
Background e-Health has played a crucial role during the COVID-19 pandemic in primary health care. e-Health is the cost-effective and secure use of Information and Communication Technologies (ICTs) to support health and health-related fields.
Ayan Chatterjee +3 more
doaj +1 more source

