A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Constructing two-writer atomic registers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing Two-Writer Atomic Registers
IEEE Transactions on Computers
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Using mappings to prove timing properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The impact of time on the session problem
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
A completeness theorem for a class of synchronization objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Fast, scalable synchronization with minimal hardware support
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Programming DEC-Alpha based multiprocessors the easy way (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Contention—free complexity of shared memory algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Journal of the ACM (JACM)
Decentralized Simulation of Resource Managers
Journal of the ACM (JACM)
A synchronization algorithm for distributed systems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
High level programming for distributed computing
Communications of the ACM
Theoretical Computer Science
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Randomized two-process wait-free test-and-set
Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
A new solution to the critical section problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On formulating simultaneity for studying parallelism and synchronization
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of problems in systems of communicating sequential processes (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Developing and Refining an Adaptive Token-Passing Strategy
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Information and Computation
A modular algorithm for resource allocation
Distributed Computing
Using mappings to prove timing properties
Distributed Computing
A modular drinking philosophers algorithm
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Distributed Computing
A self-stabilizing autonomic recoverer for eventual Byzantine software
Journal of Systems and Software
Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
Efficiency of asynchronous systems that communicate asynchronously
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Group mutual exclusion algorithms based on ticket orders
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Model checking-based genetic programming with an application to mutual exclusion
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Brief announcement: acceleration by contention for shared memory mutual exclusion algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Sub-logarithmic test-and-set against aweak adversary
DISC'11 Proceedings of the 25th international conference on Distributed computing
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
A distributed synchronization mechanism for interacting processes
Computer Languages
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.02 |
A solution to the critical section problem, first posed by Dijkstra [1], is a fundamental requirement for concurrent program control. The problem is to ensure that no two processes are in a specified area of their programs (the critical section) at the same time. Improvements to Dijkstra's solution were made by Knuth [2], deBruijn [3], and Eisenberg and McGuire [4]. The situation, for a distributed system was considered by Lamport [5]. Rivest and Pratt [6] presented a solution for a distributed system where processes may repeatedly fail. The algorithms to be presented will be further improvements, where the comparisons will be made according to three measures: message size—the number of values the variable for interprocess communication can take on; fairness—the sequence in which waiting processes enter their critical sections; and time—the amount of time a process spends attempting to enter its critical section.