Presentation
An Enablement Detection Algorithm for Open Multiparty Interactions
Author/s | 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 |
Publication Date | 2002 |
Deposit Date | 2020-08-06 |
Published in |
|
ISBN/ISSN | 978-1-58113-445-2 |
Abstract | Coordination axnongst an arbitrary number of entities has
become an important issue in recent years m fields such as e--
commerce, web-based applications and so on. Traditionally,
classical client/server primitives have ... Coordination axnongst an arbitrary number of entities has become an important issue in recent years m fields such as e-- commerce, web-based applications and so on. Traditionally, classical client/server primitives have been used to implement synchronisation and communication. But. when more than two entities need to coordinate hy means of those primitives, the coordination must be decomposed into a number of client/server hipaxty interactions, leading the programmer to the need of thinking in terms of the protocols needed to achieve properties like livenes, atomicity and so on. In this paper, we present an algorithm to perform enablement detection to implement open multiparty interactions. This primitive provides a high level of abstraction since the programmar can implement multiparty coordination without the need of thinking in terms of protocols. |
Citation | Pérez Castellanos, J.A., Corchuelo Gil, R., Ruiz Cortés, D. y Toro Bonilla, M. (2002). An Enablement Detection Algorithm for Open Multiparty Interactions. En SAC 2002: ACM symposium on Applied computing (378-384), Madrid, España: ACM Digital Library. |
Files | Size | Format | View | Description |
---|---|---|---|---|
An enablement detection algori ... | 651.2Kb | [PDF] | View/ | |