Pascal user manual and report; 3rd ed.
Pascal user manual and report; 3rd ed.
Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The efficient termination of Ada tasks in a multi-processor environment
ACM SIGAda Ada Letters
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
Distributed termination detection for dynamic systems
Parallel Computing
Development of a Class of Distributed Termination Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tiered Algorithm for Distributed Process Quiescence and Termination Detection
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
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.