Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9):1053–1065, September 1989.
T. Berners-Lee, R. Fielding, and L. Masinter. RFC 2396: Uniform resource identifiers (URI): Generic syntax, August 1998.
K.M. Chandy and Jayadev Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632–646, October 1984.
K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
R. Corchuelo, J.A. Pérez, and M. Toro. A Multiparty Coordination Aspect Language. ACM SIGPLAN, 35(12):24–32, December 2000.
R. Corchuelo, D. Ruiz, M. Toro, J.M. Prieto, and J.L. Arjona. A Distributed Solution to Multiparty Interaction, pages 318–323. World Scientific Engineering Society, 1999.
D. F. D’souza and A.C. Wills. Objects, Componentes, and Frameworks with UML: The Catalysis Approach. Addison-Wesley, 1 edition, 1999.
M.J. Elphick E. G. Coffman and A. Shoshani. System Deadlocks. Computer Surveys, 3:67–68, June 1971.
N. Francez and I. Forman. Interacting processes: A multiparty approach to coordinated distributed programming. Addison-Wesley, 1996.
C.A.R. Hoare. Communicating Sequential Processess. Prentice Hall, 1985.
Y. J. Joung and S. A. Smolka. Strong interaction fairness via randomization. In Proceedings of the 16th International Conference on Distributed Computing Systems, pages 475–483, Hong Kong, May 1996. IEEE Computer Society Press.
Y.J. Joung and S.A. Smolka. Strong interaction fairness via randomization. IEEE Transactions on Parallel and Distributed Systems, 9(2), February 1998.
J.A. Pérez, R. Corchuelo, D. Ruiz, and M. Toro. A framework for aspect—oriented multiparty coordination. In New Developments in Distributed Applications and Interoperable Systems, pages 161–174. Kluwer Academic Publishers, 2001.
J.A. Pérez, R. Corchuelo, D. Ruiz, and M. Toro. An enablement detection algorithm for open multiparty interactions. In ?, editor, Proceedings of the Symposium on Applied Computing SAC’02, number ? in ?, page ?, Madrid, Spain, March 2002. ?, ? Appearing soon.
D. Rogerson. Inside COM. Microsoft Press, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez, J.A., Corchuelo, R., Ruiz, D., Toro, M. (2002). An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions. In: Arbab, F., Talcott, C. (eds) Coordination Models and Languages. COORDINATION 2002. Lecture Notes in Computer Science, vol 2315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46000-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-46000-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43410-8
Online ISBN: 978-3-540-46000-8
eBook Packages: Springer Book Archive