DocumentCode
753408
Title
Achieving Distributed Termination without Freezing
Author
Francez, Nissim ; Rodeh, Michael
Author_Institution
Department of Computer Science, Technion–Israel Institute of Technology
Issue
3
fYear
1982
fDate
5/1/1982 12:00:00 AM
Firstpage
287
Lastpage
292
Abstract
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.
Keywords
CSP; Communication; concurrency; distributed programs; distributed termination; Algorithm design and analysis; Bismuth; Computer science; Concurrent computing; Delay; Design methodology; Distributed computing; Programming profession; Stability; State-space methods; CSP; Communication; concurrency; distributed programs; distributed termination;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1982.235257
Filename
1702944
Link To Document