Results 241 to 250 of about 119,463 (291)
Some of the next articles are maybe not open access.
A unified algorithm for mutual exclusiveness identification
Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium, 1999This paper presents a new method for identifying mutually exclusive operations pairs in behavioral descriptions in the context of high-level synthesis. It is based on two main features: i) the choice of a suitable formal representation of the behavior that exploits its maximum degree of parallelism and ii) a behavior preserving transformation of that ...
Olga Peñalba +2 more
openaire +1 more source
Automated analysis of mutual exclusion algorithms using CCS
Formal Aspects of Computing, 1989 D. Walker
exaly +2 more sources
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems, 1987A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.
openaire +1 more source
Hemlock: Compact and Scalable Mutual Exclusion
ACM Symposium on Parallelism in Algorithms and Architectures, 2021We present Hemlock, a novel mutual exclusion locking algorithm that is extremely compact, requiring just one word per thread plus one word per lock, but which still provides local spinning in most circumstances, high throughput under contention, and low ...
D. Dice, Alex Kogan
semanticscholar +1 more source
An algorithm for distributed mutual exclusion
Information and Software Technology, 1995Abstract A distributed algorithm is proposed that realizes mutual exclusion among n nodes in a computer network. No common or global memory is shared by the nodes for internode communication; instead this is done by exchanging messages. The algorithm requires at most 3√n messages per mutual exclusion invocation.
openaire +1 more source
A fast, scalable mutual exclusion algorithm
Distributed Computing, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Yang, J. Anderson
openaire +3 more sources
Property assessment of Peterson's mutual exclusion algorithms
Applied Computing and IntelligenceThe goal of this work was to experiment with the formal modeling and automated reasoning of concurrent/parallel systems, mainly focusing on mutual exclusion algorithms. A concrete method is presented, which depends on timed automata and the model checker
L. Nigro, F. Cicirelli
semanticscholar +1 more source
A distributed K-mutual exclusion algorithm
Proceedings of 15th International Conference on Distributed Computing Systems, 2002This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads.
Shailaja Bulgannawar, Nitin H. Vaidya
openaire +1 more source
A robust distributed mutual exclusion algorithm
2005Correct operation of a distributed system with replicated resources requires that mutual exclusion be maintained among independent requests to these resources at different sites in the system. In this paper, we propose “asymptotically high resiliency” as a performance measure for fault-tolerant mutual exclusion algorithms for systems where sites can ...
Sampath Rangarajan, Satish K. Tripathi
openaire +1 more source
A note on Lamport's mutual exclusion algorithm
ACM SIGOPS Operating Systems Review, 1990The Lamport's mutual exclusion exclusion algorithm, also known as the bakery algorithm, is very simple and easy to implement. However, the ticket numbers assigned to the processes wishing to enter the critical section can become indeterminately large.
openaire +1 more source