Results 251 to 260 of about 119,463 (291)
Some of the next articles are maybe not open access.
1997
This chapter describes a project accomplished by Jens B. Jorgensen and Lars M. Kristensen, Aarhus University, Denmark. The chapter is based upon the material presented in [34]. The project was conducted in 1996.
openaire +1 more source
This chapter describes a project accomplished by Jens B. Jorgensen and Lars M. Kristensen, Aarhus University, Denmark. The chapter is based upon the material presented in [34]. The project was conducted in 1996.
openaire +1 more source
Priority Mutual Exclusion: Specification and Algorithm
2016Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of this problem, which we call priority mutual exclusion, processes have priorities and the requirement is that, whenever the critical section becomes vacant, the next occupant should be the process that has the highest priority among the waiting processes ...
Chien-Chung Huang 0001, Prasad Jayanti
openaire +1 more source
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Information Processing Letters, 2000Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion.
Leslie Lamport +2 more
openaire +2 more sources
A hybrid distributed mutual exclusion algorithm
Journal of Systems Architecture, 1996Abstract This paper presents a hybrid approach to distributed mutual exclusion in which two algorithms are combined such that one minimizes message traffic and the other minimizes time delay. In a hybrid approach, sites are divided into groups, and two different algorithms are used to resolve local (intra-group) and global (inter-group) conflicts. In
openaire +1 more source
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Merritt, Gadi Taubenfeld
openaire +2 more sources
Deriving a scalable algorithm for mutual exclusion
1998This paper details the design of a scalable algorithm for the mutual exclusion problem. Starting by inserting a redundant assignment into Peterson's algorithm for two processes, we derive another algorithm that uses only local spins, i.e., a process busy-waits only on locally accessible shared variables. The new two-process algorithm is then adapted to
openaire +1 more source
A Generalized Mutual Exclusion Problem and Its Algorithm
2013 42nd International Conference on Parallel Processing, 2013Mutual exclusion (ME) is a fundamental problem for resource allocation in distributed systems, It is concerned with how the various processes access shared resources in a mutually exclusive way. Besides the classic ME problem, several variant problems have been proposed and studied.
Aoxueluo +3 more
openaire +1 more source
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems, 1989We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology of this tree.
openaire +3 more sources
PROOF OF A REAL-TIME MUTUAL-EXCLUSION ALGORITHM
Parallel Processing Letters, 1996Michael Fischer has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the time-honored technique of establishing an appropriate invariant.
J. Allen Carruth, Jayadev Misra
openaire +1 more source
Speedup of lockout-free mutual exclusion algorithms
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99), 2003We propose three lockout-free mutual exclusion algorithms for the asynchronous multi-writer/reader shared memory model. The first two algorithms are modifications of the n-process algorithm by G.L. Peterson (1981), and the third algorithm is a modification of the tournament algorithm by G.L. Peterson and M.J. Fischer (1977).
Yoshihide Igarashi, Yasuaki Nishitani
openaire +1 more source