Results 31 to 40 of about 485,027 (292)

A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set [PDF]

, 2007
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type (or a group) with each critical section.
Neeraj Mittal, Ranganath Atreya, Sathya Peri   +2 more
core   +2 more sources

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

Group Mutual Exclusion in Linear Time and Space

, 2015
We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served.
Gafni, Eli, Gopalakrishnan, Krishnan, He, Yuan   +2 more
core   +1 more source

Brief Announcement: Fast and Scalable Group Mutual Exclusion [PDF]

, 2018
The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a type or session. Critical sections belonging to the same session can execute concurrently, whereas
Gokhale, Shreyas, Mittal, Neeraj
core   +1 more source

Formal Analysis of Bakery-Based Mutual Exclusion Algorithms

Computers
Lamport’s Bakery algorithm (LBA) represents a general and elegant solution to the mutual exclusion (ME) problem posed by Dijkstra in 1965. Its correctness is usually based on intuitive reasoning.
Libero Nigro
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

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

Introduction: The Social (Re)production of Diversity

Cromohs: Cyber Review of Modern Historiography, 2021
As a mutual constituent of sameness, otherness defines belonging by demarcating the boundaries of what is similar and acceptable against what is different and, eventually, unacceptable.
Giacomo Orsini
doaj   +1 more source

‘At Least I Can Do Something’: The Work of Volunteering in a Community Beset by Worklessness [PDF]

, 2008
The voluntary sector has been mainstreamed into public policy with consequences that include more reliance upon the time, commitment and skills of volunteers.
Baines, Susan, Hardill, Irene
core   +2 more sources

Distributed match-making [PDF]

, 1987
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making ...
Mullender, Sape J., Vitanyi, Paul M.B.
core   +5 more sources