Ponencia
An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions
Autor/es | Pérez Castellanos, José Antonio
Corchuelo Gil, Rafael Ruiz Cortés, David Toro Bonilla, Miguel |
Departamento | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Fecha de publicación | 2002 |
Fecha de depósito | 2017-10-18 |
Publicado en |
|
ISBN/ISSN | 978-3-540-43410-8 0302-9743 |
Resumen | 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. ... 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. |
Cita | 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
An Order-Based.pdf | 507.3Kb | [PDF] | Ver/ | |