Detecting termination of distributed computations by external agents
- 7 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
[[abstract]]An algorithm is presented that defects for termination of distributed computations by an auxiliary controlling agent. The algorithm assigns a weight W, 0<W⩽1, to each active process and to each message in transit. The algorithm maintains that the sum of all the weights related to the computation is equal to one. The controlling agent terminates the algorithm if its weight equals one. A space-efficient scheme is proposed to encode the weights such that an active process can send a very large number of messages before reaching a weight equal to one. Thus, in the proposed encoding scheme, each process and message needs only a small number of bits to encode the weight; the processes can be almost free from the delays of waiting for a supply of weights from the controlling agent[[fileno]]2030249030012[[department]]資訊工程學This publication has 9 references indexed in Scilit:
- A fully distributed termination detection schemeInformation Processing Letters, 1988
- A termination detection protocol and its formal verificationJournal of Parallel and Distributed Computing, 1988
- Termination detection for dynamically distributed systems with non-first-in-first-out communicationJournal of Parallel and Distributed Computing, 1986
- Termination detection for distributed computationsInformation Processing Letters, 1984
- A distributed solution of the distributed termination problemInformation Processing Letters, 1983
- Derivation of a termination detection algorithm for distributed computationsInformation Processing Letters, 1983
- Achieving Distributed Termination without FreezingIEEE Transactions on Software Engineering, 1982
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980