Results 41 to 50 of about 464,155 (337)

Technical Report: Asymmetric Mutual Exclusion for RDMA [PDF]

arXiv, 2022
Coordinating concurrent access to a shared resource using mutual exclusion is a fundamental problem in computation. In this paper, we present a novel approach to mutual exclusion designed specifically for distributed systems leveraging a popular network communication technology, remote direct memory access (RDMA).
arxiv  

(h,k)-Arbiters for h-out-of-k mutual exclusion problem [PDF]

, 2004
h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h(1⩽h⩽k) units at the same time.
Manabe, Yoshifumi, Tajima, Naka
core   +1 more source

Assignment of Resources in Distributed Systems [PDF]

Journal of Systemics, Cybernetics and Informatics, 2018
In distributed processing systems it is often necessary to coordinate the allocation of shared resources that should be assigned in the processes in the modality of mutual exclusion; in such cases, the order in which the shared resources will be assigned
David L. La Red Martínez, Julio C. Acosta, Federico Agostini   +2 more
doaj  

Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems

International Journal of Distributed Sensor Networks, 2013
Data replication is a known redundancy used in fault-tolerant distributed system. However, it has the problem of mutual exclusion of replicated data. Mutual exclusion becomes difficult when a distributed system is partitioned into two or more isolated ...
Faraneh Zarafshan, Abbas Karimi, S. A. R. Al-Haddad, M. Iqbal Saripan, Shamala Subramaniam   +4 more
doaj   +1 more source

Decomposing and Tracing Mutual Information by Quantifying Reachable Decision Regions

Entropy, 2023
The idea of a partial information decomposition (PID) gained significant attention for attributing the components of mutual information from multiple variables about a target to being unique, redundant/shared or synergetic. Since the original measure for
Tobias Mages, Christian Rohner
doaj   +1 more source

Generating Counterexamples for Model Checking by Transformation [PDF]

Electronic Proceedings in Theoretical Computer Science, 2016
Counterexamples explain why a desired temporal logic property fails to hold. The generation of counterexamples is considered to be one of the primary advantages of model checking as a verification technique.
G. W. Hamilton
doaj   +1 more source

Verifying Mutual Exclusion Algorithms with Non-Atomic Registers

Algorithms
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   +1 more source

Deliberation and Non-Deliberative Communication

Journal of Deliberative Democracy, 2020
The goal of this work is to clarify how certain democratic goods — notably, empowered inclusion and mutual respect — can be both antecedents to and outcomes of successful communication.
Edana Beauvais
doaj   +2 more sources

Probability Mass Exclusions and the Directed Components of Pointwise Mutual Information [PDF]

, 2018
This paper examines how an event from one random variable provides pointwise mutual information about an event from another variable via probability mass exclusions. We start by introducing probability mass diagrams, which provide a visual representation of how a prior distribution is transformed to a posterior distribution through exclusions. With the
arxiv   +1 more source

Methodology for Simulation-based Comparison of Algorithms for Distributed Mutual Exclusion [PDF]

arXiv, 2022
In this paper, we show how different types of distributed mutual algorithms can be compared in terms of performance through simulations. A simulation-based approach is presented, together with an overview of the relevant evaluation metrics and approach for statistical processing of the results.
arxiv