This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Achieving Distributed Termination without Freezing
May 1982 (vol. 8 no. 3)
pp. 287-292
N. Francez, Department of Computer Science, Technion-Israel Institute of Technology
An efficient algorithm for achieving distributed termination without introducing new communicaton channels and without delaying the basic computations ("freezing") is presented. The algorithm is related to the methodology of designing distributed programs where the programmer is relieved from the problem of distributed termination. An informal correctness proof and complexity analysis are included.
Index Terms:
distributed termination, Communication, concurrency, CSP, distributed programs
Citation:
N. Francez, M. Rodeh, "Achieving Distributed Termination without Freezing," IEEE Transactions on Software Engineering, vol. 8, no. 3, pp. 287-292, May 1982, doi:10.1109/TSE.1982.235257
Usage of this product signifies your acceptance of the Terms of Use.