The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Distributed Computing
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Fairness
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel program design: a foundation
Parallel program design: a foundation
Synchronization of asynchronous processes in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Coordinating first-order multiparty interactions
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interacting processes: a language for coordinated distributed programming
JCIT Proceedings of the fifth Jerusalem conference on Information technology
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Interacting processes: a multiparty approach to coordinated distributed programming
Interacting processes: a multiparty approach to coordinated distributed programming
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Distributed algorithms for ensuring fair interprocess communicatons
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Some impossibility results in interprocess synchronization
Distributed Computing
Graphs and Hypergraphs
Deducing fairness properties in UNITY logic—a new completeness result
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
| Hi-index | 0.00 |
The implementation of nondeterministic pairwise synchronous communication among a set of asynchronous processes is modeled as the binary interaction problem. The paperdescribes an algorithm for this problem that satisfies a strong fairness property thatguarantees freedom from process starvation. This is the first algorithm for binaryinteractions with strong fairness whose message cost and response time are independentof the total number of processes in the system. The paper also describes how the fairalgorithm may be extended to tolerate detectable fail-stop failures. Finally, we show howany solution to the dining philosophers problem can be embedded to design a fairalgorithm for binary interactions. In particular, this embedding is used to derive a fairalgorithm that can cope with undetectable fail-stop failures.