The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Parallel program design: a foundation
Parallel program design: a foundation
Principles of concurrent and distributed programming
Principles of concurrent and distributed programming
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Distributed Algorithms
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Simple Local-Spin Group Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
A highly concurrent group mutual l-exclusion algorithm0
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A simple group mutual l-exclusion algorithm
Information Processing Letters
The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The congenial talking philosophers problem in computer networks
Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A General Resource Allocation Synchronization Problem
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Token Based Group Mutual Exclusion for Asynchronous Rings (Extended Abstract)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
Stabilizing mobile philosophers
Information Processing Letters
A Hierarchical Approach to Handle Group Mutual Exclusion Problem in Distributed Systems
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Stabilizing mobile philosophers
Information Processing Letters
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Group mutual exclusion in O(log n) RMR
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A group quorum system of degree 1+√1+n/m
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A novel distributed scheduling algorithm for resource sharing under near-heavy load
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
Abortable reader-writer locks are no more complex than abortable mutex locks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
AutoSynch: an automatic-signal monitor based on predicate tagging
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |