Multiaccess in a nonqueueing mailbox environment
IEEE Transactions on Software Engineering
Algorithms for mutual exclusion
Algorithms for mutual exclusion
A Note on Concurrent Programming Control
IEEE Transactions on Software Engineering
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Solution of a problem in concurrent programming control
Communications of the ACM
A new solution to the critical section problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Automatic Generation of Invariants
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Abstracting WS1S Systems to Verify Parameterized Networks
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Liveness with (0, 1, infty)-Counter Abstraction
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Predicate abstraction and refinement for verifying multi-threaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallelizing a symbolic compositional model-checking algorithm
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Getting rid of store-buffers in TSO analysis
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Environment abstraction for parameterized verification
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
Science of Computer Programming
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A new simple solution to the Lamport's concurrent programming problem is presented. The algorithm uses five distinct values of shared memory per process. The shared values can be stored either in a single variable or in three one-bit Boolean variables assigned to each process. The algorithm exhibits strong fairness property by enforcing the linear wait. It can be made immune to two types of errors typical to VLSI chip based multiprocessor systems: process failures and restarts, and read errors occurring during writes.The algorithm requires a small number of writes to shared memory. At most 4xp- ⌈p/n⌉ writes are needed for p entries to critical section by n competing processes. The algorithm's scheme is similar to that of Morris's solution to the mutual exclusion based on three weak semaphores.