Results 221 to 230 of about 119,463 (291)

Automatic Discovery of Mutual Exclusion Algorithms

Lecture Notes in Computer Science, 2003
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known problem of mutual exclusion. The methodology is rather simple and the fact that it is computationally feasible is surprising.
Gadi Taubenfeld
exaly   +3 more sources

Distributed Mutual Exclusion Algorithms on a Ring of Clusters

Lecture Notes in Computer Science, 2004
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms. Each node on the ring represents a cluster of nodes and implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents.
Kayhan Erciyes
exaly   +3 more sources

Modelling and Verification of Mutual Exclusion Algorithms

2016 IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2016
This paper proposes modelling and exhaustive verification of mutual exclusion algorithms using timed automata (TA) and the popular UPPAAL toolbox. The proposal allows to check all the properties of a mutual clusion algorithm also along the time dimension.
Cicirelli F, NIGRO, Libero
openaire   +5 more sources

Randomized mutual exclusion algorithms revisited

open access: yesProceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92, 1992
In [4] a randomized algorithm for mutual exclusion with bounded waiting, employing a logarithmic sized shared variable, was given. Saias and Lynch [5] pointed out that the adversary scheduler postulated in the above paper can observe the behavior of processes in the interval between an opening of the critical section and the next closing of the ...
Eyal Kushilevitz, Michael O. Rabin
openaire   +2 more sources

Fault-tolerant mutual exclusion algorithms

Journal of Systems and Software, 1990
Abstract A distributed computing system or a computer network consists of an interconnection of a set of N independently running computer systems called the nodes of the network. These nodes communicate among themselves only by exchanging messages.
Shivakant Mishra, Pradip K. Srimani
openaire   +2 more sources

The information structure of distributed mutual exclusion algorithms

open access: yesACM Transactions on Computer Systems, 1987
The concept of an information structure is introduced as a unifying principle behind several of the numerous algorithms that have been proposed for the distributed mutual exclusion problem. This approach allows the development of a generalized mutual exclusion algorithm that accepts a particular information structure at initialization and realizes both
B. Sanders
openaire   +3 more sources

Home - About - Disclaimer - Privacy