Results 1 to 10 of about 482,704 (293)

Black-White Bakery Algorithm Made RW-Safe

open access: yesComputers
Lamport’s Bakery algorithm is a well-known, simple, and elegant solution to the mutual exclusion problem for N ≥ 2 concurrent/parallel processes. However, the algorithm generates an unbounded number of tickets, even when only 2 processes are arbitrated ...
Libero Nigro, Franco Cicirelli
doaj   +1 more source

Exclusively Mutual

open access: yesPerformative Practices: Architecture and Engineering in the 21st Century, 2011
As individuals, institutions, and agencies stumble over each other creating new benchmarks for performance, speaking past one another along the way, the concept of performance becomes increasingly illusive – as does its implication in architectural practice. MECHANISTICALLY, it is a manner or quality of functioning.
openaire   +1 more source

Recoverable Mutual Exclusion with Abortability [PDF]

open access: yesComputing, 2019
AbstractRecent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures that cause processes to crash and subsequently restart. In this paper we present a Recoverable Mutual Exclusion (RME) algorithm that supports abortability.
Prasad Jayanti, Anup Joshi
openaire   +2 more sources

Hypothesis Competition beyond Mutual Exclusivity [PDF]

open access: yesPhilosophy of Science, 2017
Competition between scientific hypotheses is not always a matter of mutual exclusivity. Consistent hypotheses can compete to varying degrees either directly or indirectly via a body of evidence. We motivate and defend a particular account of hypothesis competition by showing how it captures these features. Computer simulations of Bayesian inference are
Schupbach, Jonah N., Glass, David H.
openaire   +1 more source

Fractional exclusion statistics in general systems with interaction

open access: yes, 2008
I show that fractional exclusion statistics (FES) is manifested in general interacting systems and I calculate the exclusion statistics parameters. Most importantly, I show that the mutual exclusion statistics parameters--when the presence of particles ...
Anghel   +26 more
core   +1 more source

A minimal model for multiple epidemics and immunity spreading. [PDF]

open access: yesPLoS ONE, 2010
Pathogens and parasites are ubiquitous in the living world, being limited only by availability of suitable hosts. The ability to transmit a particular disease depends on competing infections as well as on the status of host immunity.
Kim Sneppen   +3 more
doaj   +1 more source

Mutually exclusive events

open access: yes, 2021
Background: Why should, and how could the occurrence of an event At at a certain (period of) time / Bernoulli trial t exclude the occurrence of another event Bt at the same (period of) time / Bernoulli trial t and vice versa? Can this be described mathematically, somehow? Methods: Basic methods of classical logic, probability theory and statistics were
openaire   +1 more source

Mutual exclusion revisited [PDF]

open access: yesProceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology', 2002
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to various faults. The algorithms are based on a scheme similar to J.M. Morris's (1979) solution of the mutual exclusion problem with three weak semaphores. The present
openaire   +1 more source

Proving Properties of Dekker’s Algorithm for Mutual Exclusion of N Processes

open access: yesAlgorithms
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
Libero Nigro, Franco Cicirelli
doaj   +1 more source

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

open access: yes, 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   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy