Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-46000-4_24 | COORDINATION |
Keywords | Field | DocType |
useful mechanism,common goal,interaction manager,multiparty interaction,recent year,previous result,implementing multiparty interactions,communication link,open systems,distributed algorithm | Compile time,Computer science,Theoretical computer science,Distributed algorithm,Open system (systems theory),Distributed computing | Conference |
Volume | ISSN | ISBN |
2315 | 0302-9743 | 3-540-43410-0 |
Citations | PageRank | References |
7 | 0.58 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José Antonio Pérez | 1 | 51 | 4.64 |
| Rafael Corchuelo | 2 | 389 | 49.87 |
| David Ruiz | 3 | 152 | 20.62 |
| Miguel Toro | 4 | 7 | 0.58 |