A Generalized Mutual Exclusion Problem and Its Algorithm

Generalized distributed mutual exclusion algorithms allow processes to concurrently access a set of shared resources. However, they must ensure an exclusive access to each resource. In order to avoid deadlocks, many of them are based on the strong assumption of a prior knowledge about conflicts between processes' requests. Some other approaches, which do not require such a knowledge, exploit broadcast mechanisms or a global lock, degrading message complexity and synchronization cost. We propose in this paper a new solution for shared resources allocation which reduces the communication between non-conflicting processes without a prior knowledge of processes conflicts. Performance evaluation results show that our solution improves resource use rate by a factor up to 20 compared to a global lock based algorithm.

show abstract

“…• group mutual exclusion problem [16], [17], [18]: a shared resource can be accessed concurrently but only within the same session.…”

Section: Related Workmentioning

confidence: 99%

Reducing Synchronization Cost in Distributed Multi-resource Allocation Problem

Lejeune

Arantes

Sopena

et al. 2015

2015 44th International Conference on Parallel Processing

View full text Add to dashboard Cite

show abstract

“…In such cases, there is a need to apply formal verification for achieving reliable results. Formal verification is used in applications of VANETs such as cooperative collision avoidance [7], intersection management using mutual exclusion algorithms [2], and collaborative driving [10]. However, to the best of our knowledge, there is no work on formal verification of WMD application in VANETs.…”

Section: Introductionmentioning

confidence: 99%

VeriVANca: An Actor-Based Framework for Formal Verification of Warning Message Dissemination Schemes in VANETs

Yousefi

Khamespanah

Gharib

et al. 2019

Model Checking Software

View full text Add to dashboard Cite

One of the applications of vehicular ad-hoc networks is warning message dissemination among vehicles in dangerous situations to prevent more damage. The only communication mechanism for message dissemination is multi-hop broadcast; in which, forwarding a received message have to be regulated using a scheme regarding the selection of forwarding nodes. When analyzing these schemes, simulation-based frameworks fail to provide guaranteed analysis results due to the high level of concurrency in this application. Therefore, there is a need to use model checking approaches for achieving reliable results. In this paper, we have developed a framework called VeriVANca, to provide model checking facilities for the analysis of warning message dissemination schemes in VANETs. To this end, an actor-based modeling language, Rebeca, is used which is equipped with a variety of model checking engines. To illustrate the applicability of VeriVANca, modeling and analysis of two warning message dissemination schemes are presented. Some scenarios for these schemes are presented to show that concurrent behaviors of the system components may cause uncertainty in both behavior and performance which may not be detected by simulation-based techniques. Furthermore, the scalability of VeriVANca is examined by analyzing a middle-sized model.

show abstract

“…In terms of the maximal number of processes in a group, two classes of mutual exclusion problem are distinguished in the literature. The first class, called the basic mutual exclusion problem [2,3,4,5,6,7,8,9], where the maximum size of groups is one, and the second class called group mutual exclusion (GME) problem, where every group can have more than one process [1,10,11,12,13,14,15,16].…”

Section: Preliminariesmentioning

confidence: 99%