The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communicating sequential processes
Parallel program design: a foundation
Parallel program design: a foundation
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Interacting processes: a multiparty approach to coordinated distributed programming
Interacting processes: a multiparty approach to coordinated distributed programming
Inside COM
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
Objects, components, and frameworks with UML: the catalysis approach
Objects, components, and frameworks with UML: the catalysis approach
ACM Computing Surveys (CSUR)
A multiparty coordination aspect language
ACM SIGPLAN Notices
An enablement detection algorithm for open multiparty interactions
Proceedings of the 2002 ACM symposium on Applied computing
A Framework for Aspect-Oriented Multiparty Coordination
Proceedings of the IFIP TC6 / WG6.1 Third International Working Conference on New Developments in Distributed Applications and Interoperable Systems
Strong interaction fairness via randomization
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Aspect-oriented interaction in multi-organisational web-based systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Autonomous-Centered problem allocation oriented to cooperation
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
| Hi-index | 0.00 |
Multiparty interactions have been paid much attention in recent years because they provide the user with a useful mechanism for coordinating a number of entities that need to cooperate in order to achieve a common goal. In this paper, we present an algorithm for implementing them that is based on the idea of locking resources in a given order. It improves on previous results in that it can be used in a context in which the set of participants in an interaction cannot be known at compile time, and setting up communication links amongst interaction managers is costly or completely impossible.