Knowledge in shared memory systems (preliminary version)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Knowledge in shared memory systems (preliminary version)

Full text

Pdf (1.20 MB)

Source

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

Montreal, Quebec, Canada

Pages: 189 - 200

Year of Publication: 1991

ISBN:0-89791-439-2

Authors

Michael Merritt	L&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Gadi Taubenfeld	L&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ

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

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

	ABD+90	Hagit Attiya , Amotz Bar-Noy , Danny Dolev , David Peleg , Rüdiger Reischuk, Renaming in an asynchronous environment, Journal of the ACM (JACM), v.37 n.3, p.524-548, July 1990 [doi>10.1145/79147.79158]
	CM86	K. M. Chandy , Jayadev Misra, How processes learn, Distributed Computing, v.1 n.1, p.40-52, Jan. 1986 [doi>10.1007/BF01843569]
	DM86	C Dwork , Y Moses, Knowledge and common knowledge in a Byzantine environment I: crash failures, Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge, p.149-169, March 1986, Monterey, California, United States
	FHV84	R. Fagin. Y. J. Halpern, and M. Vardi. A model theoretic analysis of knowledge. In Proc. 25th IEEE Syrup. on Foundations of Computer Science, pages 268-278, 1984.
	FI86	M Fischer , N Immerman, Foundations of knowledge for distributed systems, Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge, p.171-185, March 1986, Monterey, California, United States
	FLP85	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]
	FMRT90	M. J. Fischer , S. Moran , R. Rudich , G. Taubenfeld, The wakeup problem, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.106-116, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100228]
	FZ88	Michael J. Fischer , Lenore D. Zuck, Reasoning about uncertainty in fault-tolerant distributed systems, Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, p.142-158, September 1988, Warwick, United Kingdom
	Had87	V. Hadzilacos, A knowledge-theoretic analysis of atomic commitment protocols, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.129-134, March 23-25, 1987, San Diego, California, United States [doi>10.1145/28659.28672]
	Hal87	Y.J. Halpern. Using reasoning about knowledge to analyze distributed syst, ems. Annual Review of Computer Science, 2:37-68, 1987.
	HF85	Joseph Y. Halpern , Ronald Fagin, A formal model of knowledge, action, and communication in distributed systems: preliminary report, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.224-236, August 1985, Minaki, Ontario, Canada [doi>10.1145/323596.323617]
	HM90	Joseph Y. Halpern , Yoram Moses, Knowledge and common knowledge in a distributed environment, Journal of the ACM (JACM), v.37 n.3, p.549-587, July 1990 [doi>10.1145/79147.79161]
	HZ87	Joseph Y. Halpern, A little knowledge goes a long way: simple knowledge-based derivations and correctness proofs for a family of protocols, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.269-280, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41863]
	KT86	Shmuel Katz , Gadi Taubenfeld, What processes know: Definitions and proof methods, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.249-262, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10612]
	LA87	C.M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163- 183, 1987.
	Lam78	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	Leh84	Daniel Lehmann, Knowledge, common knowledge and related puzzles (Extended Summary), Proceedings of the third annual ACM symposium on Principles of distributed computing, p.62-67, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806736]
	Maz89	Murray Sandor Mazer , G. Burns, A knowledge-theoretic account of negotiated commitment, 1989
	Mic89	R. Michel, A categorical approach to distributed systems expressibility and knowledge, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.129-143, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72990]
	MR89	Y. Moses , G. Roth, On reliable message diffusion, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.119-127, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72989]
	MT88	Y. Moses and M. R. Tuttle. Programming sinmltaneous actions using common kilowledge. Algorithmica, 3:121- 169, 1988.
	MW87	S. Moran , Y. Wolfstahl, Extended impossibility results for asynchronous complete networks, Information Processing Letters, v.26 n.3, p.145-151, Nov. 23, 1987 [doi>10.1016/0020-0190(87)90052-4]
	NT87	Gil Neiger , Sam Toueg, Substituting for real time and common knowledge in asynchronous distributed systems, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.281-293, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41864]
	PR85	Rohit Parikh , R. Ramanujam, Distributed Processes and the Logic of Knowledge, Proceedings of the Conference on Logic of Programs, p.256-268, June 17-19, 1985
	Tau87	G. Taubenfeld. hnpossibility results for decision protocols. Technical Report 445, Technion~ January 1987. Revised version appeared as Technion TR- y506, April 1988.
	Tau91	Gadi Taubenfeld, On the nonexistence of resilient consensus protocols, Information Processing Letters, v.37 n.5, p.285-289, March 14, 1991 [doi>10.1016/0020-0190(91)90221-3]
	TKM89	Gadi Taubenfeld , Shmuel Katz , Shlomo Moran, Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version), Proceedings of the Ninth Conference on Foundations of Software Technology and Theoretical Computer Science, p.109-120, December 19-21, 1989
	TM89	Gadi Taubenfeld , Shlomo Moran, Possibility and Impossibility Results in a Shared Memory Environment, Proceedings of the 3rd International Workshop on Distributed Algorithms, p.254-267, September 26-28, 1989
	Tut90	M. Tuttle. Knowledge and distributed computation. Technical Report MIT/LCS/TR-477, Department of Computer Science. MIT, May 1990. PhD Thesis.
	WZ89	Da-Wei Wang , L. D. Zuck, Tight bounds for the sequence transmission problem, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.73-83, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72986]

CITED BY 6

	Michael Saks , Fotios Zaharoglou, Wait-free k-set agreement is impossible: the topology of public knowledge, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.101-110, May 16-18, 1993, San Diego, California, United States
	Yoram Moses , Ben Bloom, Knowledge, timed precedence and clocks (preliminary report), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.294-303, August 14-17, 1994, Los Angeles, California, United States
	Robert Cypher, The communication requirements of mutual exclusion, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.147-156, June 24-26, 1995, Santa Barbara, California, United States
	Jae-Heon Yang , James H. Anderson, Time bounds for mutual exclusion and related problems, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.224-233, May 23-25, 1994, Montreal, Quebec, Canada
	Danny Hendler , Nir Shavit, Operation-valency and the cost of coordination, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.84-91, July 13-16, 2003, Boston, Massachusetts
	Faith Fich , Danny Hendler , Nir Shavit, On the inherent weakness of conditional synchronization primitives, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada