论文信息 - An efficient distributed termination

An efficient distributed termination

Detecting termination of a program is an important task in distributed computing systems. Wedescribe a method for detecting distributed termination, called SP - termination, whichhas certain advantages over the known methods: shorter time delays, better distribution of control messages over the communication network, suitability for concurrent job processing, higher reliability. This approach provides also an improvement for dynamic distributed systems.

Eliezer L. Lozinskii

[1] Jack Minker,et al. Logic and Databases: A Deductive Approach , 1984, CSUR.

[2] Eliezer L. Lozinskii,et al. A problem-oriented inferential database system , 1986, TODS.

[3] Michael Rodeh,et al. Achieving Distributed Termination without Freezing , 1982, IEEE Transactions on Software Engineering.

[4] Rodney W. Topor,et al. Termination Detection for Distributed Computations , 1984, Inf. Process. Lett..

[5] Jayadev Misra,et al. Detecting termination of distributed computations using markers , 1983, PODC '83.

[6] Krzysztof R. Apt,et al. Correctness proofs of distributed termination algorithms , 1986, TOPL.

[7] S. P. Rana,et al. A Distributed Solution of the Distributed Termination Problem , 1983, Inf. Process. Lett..

[8] A. J. M. van Gasteren,et al. Derivation of a Termination Detection Algorithm for Distributed Computations , 1983, Inf. Process. Lett..

[9] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[10] Nissim Francez,et al. Distributed Termination , 1980, TOPL.

[11] Jean-Luc Richier,et al. Distributed Termination in CSP: Symmetric Solutions with Minimal Storage , 1985, STACS.

[12] Daniel Lehmann,et al. Dynamic systems and their distributed termination , 1982, PODC '82.