On Describing the Behavior and Implementation of Distributed Systems
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores
IEEE Transactions on Software Engineering
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Localizing Failures in Distributed Synchronization
IEEE Transactions on Parallel and Distributed Systems
Guaranteeing fair service to persistent dependent tasks
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unbounded speed variability in distributed communication systems
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed algorithms for synchronizing interprocess communication within real time
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Real time resource allocation in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed algorithms for ensuring fair interprocess communicatons
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Brief announcement: wait-free dining for eventual weak exclusion
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Wait-free dining under eventual weak exclusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Theoretical Computer Science
| Hi-index | 0.00 |
Dijkstra's informally-stated Dining Philosophers problem [D] involves a number n of philosophers sitting in a circle, a single fork between each pair of adjacent philosophers. The problem is to program the philosophers in ways which guarantee certain conditions of fairness and absence of deadlock. In this paper, the problem is generalized to a distributed system resource allocation problem which is local in two senses. First, although the system and number of users can be very large, there is a limit to the overlap in resource demands of different users. The second condition can be thought of as a property of the geography of the network - the resources are (or can be) located in the network in such a way that communication between a user and any of its required resources is fast.