The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Script: a communication abstraction mechanism and its verification
Science of Computer Programming
A Message-Based Approach to Discrete-Event Simulation
IEEE Transactions on Software Engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
An environment for the design and performance analysis of distributed systems
An environment for the design and performance analysis of distributed systems
Parallel program design: a foundation
Parallel program design: a foundation
Output Guards and Nondeterminism in “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
Communicating sequential processes
Communications of the ACM
A Distributed Algorithm to Implement N-Party Rendevouz
Proceedings of the Seventh Conference on Foundations of Software Technology and Theoretical Computer Science
Synchronization of asynchronous processes in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Coordinating first-order multiparty interactions
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
obTIOS: a CAx-framework service for building concurrent engineering environments
SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
A comprehensive study of the complexity of multiparty interaction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coordinating first-order multiparty interactions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A comprehensive study of the complexity of multiparty interaction
Journal of the ACM (JACM)
On strong-feasibilities of equivalence-completions
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
An enablement detection algorithm for open multiparty interactions
Proceedings of the 2002 ACM symposium on Applied computing
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
Aspect-oriented interaction in multi-organisational web-based systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Hierarchical task topology for retrieving information from within a simulated information ecosystem
Journal of Network and Computer Applications - Special issue on computational intelligence on the internet
Some impossibility results in interprocess synchronization
Distributed Computing
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
From high-level component-based models to distributed implementations
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Automated distributed implementation of component-based models with priorities
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Distributed implementation of systems with multiparty interactions and priorities
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Rigorous system design: the BIP approach
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Designing a multiway synchronization protocol
Computer Communications
Knowledge-Based distributed conflict resolution for multiparty interactions and priorities
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Optimized distributed implementation of multiparty interactions with observation
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Knowledge based transactional behavior
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
The author presents a simple solution for the committee coordination problem, which encompasses the synchronization and exclusion problems associated with implementing multiway rendezvous, and shows how it can be implemented to develop a family of algorithms. The algorithms use message counts to solve the synchronization problem, and they solve the exclusion problem by using a circulating token or by using auxiliary resources as in the solutions for the dining or drinking philosophers' problems. Results of a simulation study of the performance of the algorithms are presented. The experiments measured the response time and message complexity of each algorithm as a function of variations in the model parameters, including network topology and level of conflict in the system. The results show that the response time for algorithms proposed is significantly better than for existing algorithms, whereas the message complexity is considerably worse.