Knowledge in shared memory systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1991, Pages 189-200

  Merritt, Michael ^a   Taubenfeld, Gacli ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

IMPOSSIBILITY RESULTS; MESSAGE PASSING SYSTEMS; SHARED MEMORY; SHARED MEMORY SYSTEM;

MESSAGE PASSING;

EID: 1142282482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/112600.112617     Document Type: Conference Paper

References (30)

1. H. Attiya. A. Bar-Noy. D. Dolev, D. Pe-leg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the ACM, 37(3):524-548, July 1990.
2. M. Chandy and J. Misra. How processes learn. Journal of Distributed Computing, 1:40-52. 1986.
3. C. Dwork and Y. Moses. Knowledge and common knowledge in a Byzantine environment i: Crash failures. In Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference, pages 149-169. Morgan Kaufmann, 1986.
4. R. Fagin. Y. J. Halpern. and M. Vardi. A model theoretic analysis of knowledge. I n Proc. 25th IEEE Symp. on Foundations of Computer Science, pages 268-278, 1984.
5. M. J. Fischer and N. Immerman. Foundations of knowledge for distributed systems. In Theoretical Aspects of Reasoning about Knowledge: Proceedings of the 1986 Conference, pages 171-185. Morgan Kaufmann, March 1986.
6. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus w i t h one faulty process. Journal of the ACM, 32 (2): 374-382, April 1985.
7. M.J. Fischer. S. Moran, S. Rudich. and G. Taubenfeld. The wakeup problem. In Proc. 22st ACM Symp. on Theory of Computing, pages 106-116, May 1990.
8. M. J. Fischer and L. D. Zuck. Reasoning about uncertainty in fault-tolerant distributed systems. In M. Joseph, editor, Formal Techniques in R.eal-Time and Fault-Tolerant Systems, pages 142-158. Lecture Notes in Computer Science, vol. 331, Springer-Verlag, 1988.
9. V. Hadzilacos. A knowledge theoretic analysis of atomic commitment protocols. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 129-134, 1987.
10. Y. J. Halpern. Using reasoning about knowledge to analyze distributed systems. Annual Review of Computer Science. 2:37-68, 1987.
11. Y. J. Halpern and R. Fagin. A formal model of knowledge, action, find communication in distributed systems: Preliminary report. In Proc. 4th ACM Symp. on Principles of Distributed Computing, pages 224-236. 1985.
12. Y. J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549-587, July 1990.
13. Y. J. Halpern and L. D. Zuck. A little knowledge goes a long way: Simple knowledge-based derivations and correctness proofs for a family of protocols. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 269-280, August 1987. Accepted to Journal of the ACM .
14. S. Katz and G. Taubenfeld. What processes know: Definitions and proof methods. In Proc. 5th ACM Symp. on Principles of Distributed Computing, pages 249-262, August 1986.
15. C M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163¬ 183, 1987.
16. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
17. D. Lehmann. Knowledge, common knowledge and related puzzles. In Proc. 3rd ACM Symp. on Principles of Distributed Computing, pages 62-67, 1984.
18. M. S. Mazer. A knowledge-theoretic account of negotiated commitment. Technical Report CSRI-237, Computer Systems Research Institute. University of Toronto, November 1989. PhD Thesis.
19. R. Michel. A categorical approach to distributed systems expressibility and knowledge. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 129-143, August 1989.
20. Y. Moses and G. Roth. On reliable message diffusion. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 119-127, August 1989.
21. Y. Moses and M.R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3: 121-169, 1988.
22. S. Moran and Y. Wolfsthal. Anextended impossibility result for a synchronous complete networks. Information Processing Letters, 26: 141-151, 1987.
23. G. Neiger and S. Toueg. Substituting for real time and common knowledge in asynchronous distributed system. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 281-293, 1987.
24. R. Parikh and R. Ramanujam. Distributed processes and the logic of knowledge. In R. Parikh, editor, Proceedings of the Workshop on Logic of Programs, pages 2 5 6 - 2 6 8, 1985.
25. G. Taubenfeld. Impossibility results for decision protocols. Technical Report 445, Technion, January 1987. Revised version appeared as Technion TR - #506, April 1988.
26. G. Taubenfeld. On the non existence of resilient consensus protocols. Information Processing Letters, 3 7: 285-289, 1991.
27. G. Taubenfeld, S. Katz, and S. Moran. Impossibility results in the presence of multiple faulty processes. In 9th FCT-TCS Conference, Bangalore, India, December 1989. Lecture Notes in Computer Science, vol. 405 (eds.:C.E. Veni Madhavan), Springer Verlag 1989, pages 109-120.
28. G. Taubenfeld and S. Moran. Possibility and impossibility results in a shared memory environment. In 3rd International Workshop on Distributed Algorithms, 1989. Lecture Notes in Computer Science, vol. 392 (eds.: J.C. Bermond and M. Raynal), Springer-Verlag 1989, pages 254-267.
29. M. Tuttle. Knowledge and distributed computation. Technical Report MIT/LCS/TR-477, Department of Computer Science. M I T, May 1990. PhD Thesis.
30. D.-W. Wang and L. D. Zuck. Tight bounds for the sequence transmission problem. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 73-83, August 1989.