Results 241 to 250 of about 488,983 (281)

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

Fair group mutual exclusion

Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003
In the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If two processes are in the Critical Section at the same time, then they request the same session.
Prasad Jayanti, Srdjan Petrovic, King Tan   +2 more
openaire   +2 more sources

A distributed mutual exclusion algorithm

ACM Transactions on Computer Systems, 1985
A distributed algorithm is presented that realizes mutual exclusion among N nodes in a computer network. The algorithm requires at most N message exchanges for one mutual exclusion invocation.
Ichiro Suzuki, Tadao Kasami
openaire   +1 more source

Asynchronous group mutual exclusion

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

Robust distributed mutual exclusion

Proceedings of 16th International Conference on Distributed Computing Systems, 2002
A token based algorithm for distributed mutual exclusion is presented. It uses a distributed counter to tolerate faults due to site failures and communication failures. This eliminates the need for expensive election protocols that are commonly employed in existing token-based algorithms.
openaire   +2 more sources

Untraceability and Profiling Are Not Mutually Exclusive

2010
In this paper, we study the concept of privacy-preserving multi-service subscription systems. With such system, service providers can propose to their customers, by the way of a subscription, several distinct services that users can access while being anonymous. We moreover study how users can be untraceable w.r.t.
Sébastien Canard, Amandine Jambert
openaire   +2 more sources