Abstract
A new distributed algorithm is proposed for implementing first-order multiparty interactions based on a new implementation model in which a role manager is devised for each role. The algorithm solves the problem with O(|R|2 · |P|) messages per interaction as opposed to |P|2 messages. The proposed algorithm is closer to the fully distributed one in the sense that (1) every process (role manager) only knows its adjacent role managers (processes), and (2) the time complexity of local computation in each process and role manager is equal.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS |
| Place of Publication | Los Alamitos, CA, United States |
| Publisher | IEEE |
| Pages | 537-543 |
| Number of pages | 7 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) - Tokyo, Jpn Duration: 1996 Jun 3 → 1996 Jun 6 |
Other
| Other | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) |
|---|---|
| City | Tokyo, Jpn |
| Period | 96/6/3 → 96/6/6 |
ASJC Scopus subject areas
- Engineering(all)