Abstract
This paper describes a new model for dynamic distributed systems, where new processes are added and terminated at execution time. It is an extension of the static model underlying CSP. The model uses CSP I/O commands as the basic means of communications among processes, unlike the model underlying ADA, we insist that each process knows with whom it can communicate. We actually view communication as a fully symmetric operation in which values are exchanged between two processes. A problem of distributed termination arises sometimes in a distributed system. We present a new algorithm to detect distributed termination in a dynamic system. It is better than previously published solutions.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 |
| Publisher | Association for Computing Machinery |
| Pages | 29-33 |
| Number of pages | 5 |
| ISBN (Print) | 0897910818 |
| DOIs | |
| State | Published - 18 Aug 1982 |
| Event | 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 - Ottawa, Canada Duration: 18 Aug 1982 → 20 Aug 1982 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
|---|
Conference
| Conference | 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 |
|---|---|
| Country/Territory | Canada |
| City | Ottawa |
| Period | 18/08/82 → 20/08/82 |
Bibliographical note
Publisher Copyright:© 1982 ACM.