Repositorio de producción científica de la Universidad de Sevilla

An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions

 

Advanced Search
 
Opened Access An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions
Cites

Show item statistics
Icon
Export to
Author: Pérez Castellanos, José Antonio
Corchuelo Gil, Rafael
Ruiz Cortés, David
Toro Bonilla, Miguel
Department: Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos
Date: 2002
Published in: COORDINATION 2002: 5th International Conference on Coordination Languages and Models (2002), p 250-257
ISBN/ISSN: 978-3-540-43410-8
0302-9743
Document type: Presentation
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.
Cite: Pérez Castellanos, J.A., Corchuelo Gil, R., Ruiz Cortés, D. y Toro Bonilla, M. (2002). An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions. En COORDINATION 2002: 5th International Conference on Coordination Languages and Models (250-257), York, UK: Springer.
Size: 507.3Kb
Format: PDF

URI: http://hdl.handle.net/11441/65238

DOI: 10.1007/3-540-46000-4_24

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)