Detecting global termination conditions in the face of uncertainty

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Detecting global termination conditions in the face of uncertainty

Full text

Pdf (1.56 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the sixth annual ACM Symposium on Principles of distributed computing table of contents

Vancouver, British Columbia, Canada

Pages: 109 - 124

Year of Publication: 1987

ISBN:0-89791-239-4

Authors

Yehuda Afek	AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ
Michael Saks	Rutgers University, Department of Mathematics and RUTCOR, New Brunswick, NJ and Bell Communications Research, Morristown, N.J.

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): 0, Downloads (12 Months): 14, Citation Count: 5

Additional Information:

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/41840.41850 What is a DOI?

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.

	A87a	Y. Afek. B. Awerbucb,, S. Plotkin and M. Saks, Efficient Fault Tolerant Election Algorithms with Different Termination Conditions, Work in progress, 1987.
	A87b	B. Awerbuch and S. Plotkin, Leader Election in faulty networks, Work in progress. 1987.
	B86	Reuven Bar-Yehuda , Shay Kutten, Fault Tolerant Leader Election with Termination Detection, in General Undirected Networks, Duke University, Durham, NC, 1986
	B84	Gabriel Bracha , Sam Toueg, A distributed algorithm for generalized deadlock detection, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.285-301, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806756]
	C85	K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
	C82	Shimon Cohen , Daniel Lehmann, Dynamic systems and their distributed termination, Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.29-33, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806678]
	D80	W. Dijkstra and C. S. Scholten, Termination Detection for Diffusing Computations, Information Processing Letters 11-1. (August 1980), 1-4.
	D83	D. Dolev, C. Dwork and k. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus, Proc. 24th Syrup. on Foundation of Computer Science, 1983, 393-402.
	D84	C. Dwork, N. Lynch and L. Stockmeyer, Consensus in the Presence of Partial Svnchronv, Proc. 3rd ACM Syrup. on Principles of Distributed Computing. 1984. 103-118.
	F85	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	F80	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]
	F82	N. Francez and M. Rodeh, Achieving Distributed Termination without Freezing, IEEE Trans. Soft. Eng. SE-8. (1982), 287-292.
	G83	R. G. Gallager , P. A. Humblet , P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.66-77, Jan. 1983 [doi>10.1145/357195.357200]
	G86a	Oded Goldreich , Liuba Shrira, The effects of link failures on computations in asynchronous rings, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.174-185, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10605]
	G86b	J. Green. Private Communication. 1986,
	L80	C, W. Lermen and F. B. Schneider, Detecting Distributed Termination When Processors Cat~ Fail. Tech. Rep. 80-4~9. Dep. of Computer Science, Cornell University. Ithaca, Dee. 1980.
	M83	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 [doi>10.1145/800221.806729]
	S83	A. Segall, Distributed Network Protocols. IEEE Transactions on IJlf ormation Theory IT-29. 1 (January 1983), .
	S86	N Shavit , N Francez, A new approach to detection of locally indicative stability, International Colloquium on Automata, Languages and Programming on Automata, languages and programming, p.344-358, September 1986, Rennes, France
	S85a	I_. Shrira and ~{. Rodeh. Methodologica! Construction of Reliable Distributed Algorithms, in Tech. Rep.-361. Computer Science Dept Technion . Technion. Haifa Israel, March 1985.
	S85b	L. Shrira and O. Goldreich, Electing a Leader in the Presence of Faults" A Ring as a Special Case, in Tech. Rep.-354, Colnputer Science Dept Technion, February 1985.

CITED BY 5

	Kalyan Perumalla , Richard Fujimoto, Virtual time synchronization over unreliable network transport, Proceedings of the fifteenth workshop on Parallel and distributed simulation, p.129-136, May 15-18, 2001, Lake Arrowhead, California, United States
	A. Herzberg , S. Kutten, Fast isolation of arbitrary forwarding faults, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.339-353, June 1989, Edmonton, Alberta, Canada
	Masafumi Yamashita , Tsunehiko Kameda, Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct, IEEE Transactions on Parallel and Distributed Systems, v.10 n.9, p.878-887, September 1999
	Amos Korman , Shay Kutten, Controller and estimator for dynamic networks, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
	Amos Korman, Improved compact routing schemes for dynamic trees, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, August 18-21, 2008, Toronto, Canada