Results 231 to 240 of about 119,463 (291)
Some of the next articles are maybe not open access.
On the equity of mutual exclusion algorithms in distributed systems
Information Processing Letters, 1995The basic problem in mutual exclusion in distributed systems is to insure that one and only one site has access to a critical section at any given time. Two of the more common performance metrics for mutual exclusion algorithms are (a) number of messages necessary per critical section invocation, and (b) response time which is the time interval from ...
exaly +2 more sources
Local-Spin Group Mutual Exclusion Algorithms
International Symposium on Distributed Computing, 2004Group mutual exclusion (GME) is a natural generalisation of the classical mutual exclusion problem. In GME, when a process leaves the non-critical section it requests a “session”; processes are allowed to be in the critical section simultaneously if they have requested the same session.
Robert Danek, Vassos Hadzilacos
openaire +2 more sources
Distributed Mutual Exclusion Algorithms for Intersection Traffic Control
IEEE Transactions on Parallel and Distributed Systems, 2015 Weigang Wu +2 more
exaly +2 more sources
A general scheme for token- and tree-based distributed mutual exclusion algorithms
IEEE Transactions on Parallel and Distributed Systems, 1994 J -M Helary, A Mostefaoui, M Raynal
exaly +2 more sources
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing, 2013Alex A Aravind
exaly +2 more sources
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards and Interfaces, 2003P C Saxena
exaly +2 more sources
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems, 1985A 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
An Efficient Weak Mutual Exclusion Algorithm
2009 Eighth International Symposium on Parallel and Distributed Computing, 2009The Weak Mutual Exclusion (WME) is a recently proposed abstraction which, analogously to classical Distributed Mutual Exclusion (DME), permits to serialize concurrent accesses to a shared resource. Unlike DME, however, the WME abstraction regulates the access to a replicated shared resource and is solvable in the presence of less restrictive synchrony ...
Paolo Romano 0002, Luís E. T. Rodrigues
openaire +1 more source
An efficient distributed mutual exclusion algorithm
Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing, 2002In this paper, we present a simple and efficient distributed mutual exclusion algorithm for a distributed computer system of N geographically dispersed autonomous computer sites which communicate with each other only by sending messages and do not share any memory. The intent of this work is to extend a previously known mutual exclusion algorithm given
Niki Pissinou +4 more
openaire +1 more source
Distributed mutual exclusion algorithms for grid applications: A hierarchical approach
Journal of Parallel and Distributed Computing, 2006Marin Bertier +2 more
exaly +2 more sources