Knowledge in shared memory systems

Authors:
Michael Merritt;Gadi Taubenfeld
Affiliations:
AT & T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ;AT & T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Venue:
Distributed Computing
Year:
1993

Citing 25
Cited 0

How processes learn

Distributed Computing
What processes know: Definitions and proof methods

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a Byzantine environment I: crash failures

Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Foundations of knowledge for distributed systems

Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
A knowledge-theoretic analysis of atomic commitment protocols

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extended impossibility results for asynchronous complete networks

Information Processing Letters
Substituting for real time and common knowledge in asynchronous distributed systems

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Reasoning about uncertainty in fault-tolerant distributed systems

Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On reliable message diffusion

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A categorical approach to distributed systems expressibility and knowledge

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment

Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
The wakeup problem

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the nonexistence of resilient consensus protocols

Information Processing Letters
A model-theoretic analysis of knowledge

Journal of the ACM (JACM)
A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
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
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Possibility and Impossibility Results in a Shared Memory Environment

Proceedings of the 3rd International Workshop on Distributed Algorithms
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
Distributed Processes and the Logic of Knowledge

Proceedings of the Conference on Logic of Programs
Knowledge, common knowledge and related puzzles (Extended Summary)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A knowledge-theoretic account of negotiated commitment

A knowledge-theoretic account of negotiated commitment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the relation between knowledge and space. That is, we analyze how much shared memory space is needed in order to learn certain kinds of facts. Such results are useful tools for reasoning about shared memory systems. In addition we generalize a known impossibility result, and show that results about how knowledge can be gained and lost in message passing systems also hold for shared memory systems.