Symmetry and similarity in distributed systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Symmetry and similarity in distributed systems

Full text

Pdf (981 KB)

Source

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

Minaki, Ontario, Canada

Pages: 13 - 22

Year of Publication: 1985

ISBN:0-89791-168-7

Authors

Ralph E. Johnson	Computer Science Department, Cornell University
Fred B. Schneider	Computer Science Department, Cornell University, Ithaca, NY and Computer Science Department, Cornell University

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Citation Count: 10

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/323596.323598 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.

	A80	Dana Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.82-93, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804655]
	B84	Bores, L. Symmetric Election in CSP. Tech. Report 84-31, Laboratory of information Theory and Programming, University of Paris (June 1984).
	B81	Burns, J.E. Symmetry in Systems of Asynchronous Processes. Proceedings of ~Jrid Symposium on Foundations of Computer Science (1981), 169-174.
	CM73	Chaney, T.J. and C.E. Molnar. Anomalous Behaviour of Synchronizer and Arbiter Circuits, IEEE Transactions of Computers C-22, 4 (April 1973), 421-422.
	CM84	K. M. Chandy , J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.632-646, Oct. 1984 [doi>10.1145/1780.1804]
	D71	Djikstra, E.W. Hierarchical Ordering of Sequential Processes. Acts Informatica I (1971), 115- 138.
	FLP83	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588060]
	80	Francez, N. and M. Rodeh. A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme. ~1st Symposium on Foundations of Computer Science (Oct. 1980), 373-379.
	G80	Garcia-Molina, H. Elections in a Distributed Computing System. TR-280, Princeton University (Dec. 1980).
	H78	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]
	H71	Hopcroft, J.E. An n log n algorithm for minimizing states in a finite automata. Theory of Machines and Computations Z. Kohavi and A. Paz, ed., Academic Press, New York, (1971), 189-196.
	IR81	Itah, A. and M. Rodeh. The Lord of the Ring, or Probabilistic Methods for Breaking Symmetry in Distributive Networks. RJ 3110, IBM (April 1981).
	J85	R. E. Johnson, Symmetry in distributed systems, Cornell University, Ithaca, NY, 1987
	L85	Lehmann, D.J. Private communication with F. Schneider, New Orleans (Jan. 1985).
	LR80	Lehmann, D.J. and M.O. Rabin. On the Advantages of Free Choice. Proceedings of l~th Conference on Principles of Progamming Languages (19s0), 134-13s.
	R80	Rabin, M.O. The Choice Coordination Problem. Memorandum No. UCB/ERL M80138, Univ. of California Berkeley (Aug 1980).
	RFH72	Rosenstiehl, P., J.R. Fiksel, and A. Holliger. intelligent Graphs, in Graph Theory and Computing. R. Read, ed., Academic Press, New York (1972), 2~9-265.
	S82	Eugene W. Stark, Semaphore primitives and starvation-free mutual exclusion, Journal of the ACM (JACM), v.29 n.4, p.1049-1072, Oct. 1982 [doi>10.1145/322344.322352]

CITED BY 10

	Masafumi Yamashita , Tiko Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.117-130, August 15-17, 1988, Toronto, Ontario, Canada
	E. Styer , G. L. Peterson, Tight bounds for shared memory symmetric mutual exclusion problems, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.177-191, June 1989, Edmonton, Alberta, Canada
	Naoshi Sakamoto, Comparison of initial conditions for distributed algorithms on anonymous networks, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.173-179, May 04-06, 1999, Atlanta, Georgia, United States
	J. E. Burns , Jan K. Pachl, Uniform self-stabilizing rings, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.2, p.330-344, April 1989
	Paolo Boldi , Sebastiano Vigna, Universal dynamic synchronous self-stabilization, Distributed Computing, v.15 n.3, p.137-153, July 2002
	Faith Fich , Eric Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, v.16 n.2-3, p.121-163, September 2003
	Marcos K. Aguilera, A pleasant stroll through the land of infinitely many creatures, ACM SIGACT News, v.35 n.2, June 2004
	Ömer Eǧecioǧlu , Ambuj K. Singh, Naming symmetric processes using shared variables, Distributed Computing, v.8 n.1, p.19-38, August 1994
	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
	Masafumi Yamashita , Tsunehiko Kameda, Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases, IEEE Transactions on Parallel and Distributed Systems, v.7 n.1, p.69-89, January 1996