Dynamic systems and their distributed termination

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dynamic systems and their distributed termination

Full text

Pdf (414 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing table of contents

Ottawa, Canada

Pages: 29 - 33

Year of Publication: 1982

ISBN:0-89791-081-8

Authors

Shimon Cohen
Daniel Lehmann

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 0

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800220.806678 What is a DOI?

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Krzysztof R. Apt , Nissim Francez , Willem P. de Roever, A Proof System for Communicating Sequential Processes, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.359-385, July 1980 [doi>10.1145/357103.357110]
	2	Cohen S. "Multi-processor ON-THE-FLY Garbarge Collection" Submitted for Publication 1981.
	3	Nissim Francez, Distributed Termination, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.1, p.42-55, Jan. 1980 [doi>10.1145/357084.357087]
	4	Francez N. and Rodeh M. "Achieving Distributed Termination Without Freezing" Technion TR-160 July 1980.
	5	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	6	Lehmann D. Barak A. Cohen S. and Levy J. "Communicating Processes: a language for concurrent systems" in preparation.
	7	George Milne , Robin Milner, Concurrent Processes and Their Syntax, Journal of the ACM (JACM), v.26 n.2, p.302-321, April 1979 [doi>10.1145/322123.322134]
	8	K Jensen , N Wirth , A B Mickel , J F Miner, Pascal user manual and report; 3rd ed., Springer-Verlag New York, Inc., New York, NY, 1985
	9	Wulf A.W. "Reflections in a pool of processors" CMU-CS-78-103 Carnegie mellon Univ. Pittsburg PA, February 1978.

CITED BY 9

	Edgar Knapp, Deadlock detection in distributed databases, ACM Computing Surveys (CSUR), v.19 n.4, p.303-328, Dec. 1987
	Yehuda Afek , Michael Saks, Detecting global termination conditions in the face of uncertainty, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.109-124, August 10-12, 1987, Vancouver, British Columbia, Canada
	Jayadev Misra, Detecting termination of distributed computations using markers, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.290-294, August 17-19, 1983, Montreal, Quebec, Canada
	Mani Chandy , Jayadev Misra, An example of stepwise refinement of distributed programs: quiescence detection, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.326-343, July 1986
	A. Singh , J. Schaeffer , M. Green, A Template-Based Approach to the Generation of Distributed Applications Using a Network of Workstations, IEEE Transactions on Parallel and Distributed Systems, v.2 n.1, p.52-67, January 1991
	D. Kumar, Development of a Class of Distributed Termination Detection Algorithms, IEEE Transactions on Knowledge and Data Engineering, v.4 n.2, p.145-155, April 1992
	Ten-Hwang Lai , Li-Fen Wu, An (N -1)-Resilient Algorithm for Distributed Termination Detection, IEEE Transactions on Parallel and Distributed Systems, v.6 n.1, p.63-78, January 1995
	Susan Flynn , Edith Schonberg , Edmond Schonberg, The efficient termination of Ada tasks in a multi-processor environment, ACM SIGAda Ada Letters, v.VII n.7, p.55-76, November/December 1987
	Ronald F. DeMara , Yili Tseng , Abdel Ejnioui, Tiered Algorithm for Distributed Process Quiescence and Termination Detection, IEEE Transactions on Parallel and Distributed Systems, v.18 n.11, p.1529-1538, November 2007