Results 251 to 260 of about 1,000,824 (299)

Specification and Implementation of Mutual Exclusion

IEEE Transactions on Software Engineering, 1978
This paper presents a constructive approach to the problem of specifying, implementing, and verifying operations that will give concurrent processes exclusive access to a resource. The method eliminates the need for auxiliary variables and establishes the correctness of a whole class of solutions to the same problem.
Per Brinch Hansen, Jørgen Staunstrup
openaire   +2 more sources

Marketing and political campaigning: mutually exclusive or exclusively mutual?

Qualitative Market Research: An International Journal, 2001
Questions the nature of marketing methods in political campaigns based on a grounded theoretical approach conducted using in‐depth interviews. Suggests that if marketing success is measured solely by the level of turnout then the use of marketing in political campaigns would appear to be failing.
Paul R. Baines, John Egan
openaire   +1 more source

Superstabilizing mutual exclusion

Distributed Computing, 2000
A superstabilizing protocol is a protocol that (i) is self-stabilizing, meaning that it can recover from an arbitrarily severe transient fault; and (ii) can recover from a local transient fault while satisfying a passage predicate during recovery. This paper investigates the possibility of superstabilizing protocols for mutual exclusion in a ring of ...
openaire   +2 more sources

A Taxonomy of Distributed Mutual Exclusion

Journal of Parallel and Distributed Computing, 1993
In this paper, we present a taxonomy of mutual exclusion in distributed systems where there is no shared memory and all communication is solely by passing messages. We classify these algorithms based upon their distinct features, as well as unify them based on their commonalities.
openaire   +2 more sources

Closing the complexity gap between mutual exclusion and FCFS mutual exclusion

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008
We consider the worst-case remote memory reference (RMR) complexity of first-come-first-served (FCFS) mutual exclusion (ME) algorithms for N asynchronous reliable processes that communicate only by reading and writing shared memory. We exhibit an upper bound of O(log N) RMRs for FCFS ME, which is tight, improves on prior results, and matches a lower ...
Robert Danek, Wojciech M. Golab
openaire   +2 more sources

MUTUAL EXCLUSION ON OPTICAL BUSES

Parallel Processing Letters, 2002
This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and ...
Krishna M. Kavi, Dinesh P. Mehta
openaire   +2 more sources

Timing-based mutual exclusion

[1992] Proceedings Real-Time Systems Symposium, 2003
The benefits that can be obtained by using timing information in mutual exclusion algorithms are examined. A simple and efficient timing-based mutual exclusion algorithm is given. This algorithm always guarantees mutual exclusion (i.e. even when run asynchronously) and also avoids deadlock in case certain (realistic) inexact timing constraints are met.
Nancy A. Lynch, Nir Shavit
openaire   +2 more sources

On Families of Mutually Exclusive Sets

The Annals of Mathematics, 1943
Sei \(F\) ein Mengenkörper, \(m(F)\) die obere Grenze der Mächtigkeiten aller disjunkten Teilsysteme \(T\) und \(F\). (1) Ist \(m(F)\) keine unerreichbare Kardinalzahl \(> \aleph_0\), dann gibt es ein \(T\) mit \(\overline {\overline {T}} = m(F)\); gilt auch, wenn \(F\) ein Mengenring ist.
Erdős, Pál, Tarski, A.
openaire   +1 more source

The Weak Mutual Exclusion problem

2009 IEEE International Symposium on Parallel & Distributed Processing, 2009
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Differently from DME, however, the WME abstraction regulates the access to a replicated shared resource, whose copies are locally maintained by every participating process. Also,
Paolo Romano 0002, Luís E. T. Rodrigues, Nuno Carvalho   +2 more
openaire   +2 more sources

Asynchronous group mutual exclusion

Distributed Computing, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources