An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions

  • José Antonio Pérez
  • Rafael Corchuelo
  • David Ruiz
  • Miguel Toro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2315)


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.


Multiparty interactions coordination algorithms open systems α-core 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bag89]
    R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9):1053–1065, September 1989.CrossRefGoogle Scholar
  2. [BLFM98]
    T. Berners-Lee, R. Fielding, and L. Masinter. RFC 2396: Uniform resource identifiers (URI): Generic syntax, August 1998.Google Scholar
  3. [CM84]
    K.M. Chandy and Jayadev Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632–646, October 1984.CrossRefGoogle Scholar
  4. [CM88]
    K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.Google Scholar
  5. [CPT00]
    R. Corchuelo, J.A. Pérez, and M. Toro. A Multiparty Coordination Aspect Language. ACM SIGPLAN, 35(12):24–32, December 2000.CrossRefGoogle Scholar
  6. [CRT+99]
    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.Google Scholar
  7. [DW99]
    D. F. D’souza and A.C. Wills. Objects, Componentes, and Frameworks with UML: The Catalysis Approach. Addison-Wesley, 1 edition, 1999.Google Scholar
  8. [EGCS71]
    M.J. Elphick E. G. Coffman and A. Shoshani. System Deadlocks. Computer Surveys, 3:67–68, June 1971.zbMATHCrossRefGoogle Scholar
  9. [FF96]
    N. Francez and I. Forman. Interacting processes: A multiparty approach to coordinated distributed programming. Addison-Wesley, 1996.Google Scholar
  10. [Hoa85]
    C.A.R. Hoare. Communicating Sequential Processess. Prentice Hall, 1985.Google Scholar
  11. [JS96]
    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.Google Scholar
  12. [JS98]
    Y.J. Joung and S.A. Smolka. Strong interaction fairness via randomization. IEEE Transactions on Parallel and Distributed Systems, 9(2), February 1998.Google Scholar
  13. [PCRT01]
    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.Google Scholar
  14. [PCRT02]
    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.Google Scholar
  15. [Rog97]
    D. Rogerson. Inside COM. Microsoft Press, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • José Antonio Pérez
    • 1
  • Rafael Corchuelo
    • 1
  • David Ruiz
    • 1
  • Miguel Toro
    • 1
  1. 1.Dpto. de Lenguajes y Sistemas InformáticosUniversidad de SevillaSevillaSpain

Personalised recommendations