On the public citation graph
Causal memory
0 signed · 74 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/2.15openalex-snapshot
Synchronization, coherence, and event ordering in multiprocessors
inferredcites →https://doi.org/10.1109/iccl.1988.13046openalex-snapshot
Distributed programming with shared data
inferredcites →https://doi.org/10.1109/icdcs.1989.37982openalex-snapshot
An analysis of distributed shared memory algorithms
inferredcites →https://doi.org/10.1109/icdcs.1990.89297openalex-snapshot
Slow memory: weakening consistency to enhance concurrency in distributed shared memories
inferredcites →https://doi.org/10.1109/icdcs.1991.148677openalex-snapshot
Implementing and programming causal distributed shared memory
inferredcites →https://doi.org/10.1109/icpp.2000.876064openalex-snapshot
Proceedings of the 2000 International Conference on Parallel Processing
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/325096.325102openalex-snapshot
Memory consistency and event ordering in scalable shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/325164.325100openalex-snapshot
Weak ordering---a new definition
inferredcites →https://doi.org/10.1145/325164.325124openalex-snapshot
Adaptive software cache management for distributed shared memory architectures
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/5001.5007openalex-snapshot
Axioms for memory access in asynchronous hardware systems
inferredcites →https://doi.org/10.1145/74850.74871openalex-snapshot
Mirage: a coherent distributed shared memory design
inferredcites →https://doi.org/10.1145/75104.75105openalex-snapshot
Memory coherence in shared virtual memory systems
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/99163.99182openalex-snapshot
Munin: distributed shared memory based on type-specific memory coherence
inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot
Bounded Concurrent Time-Stamp Systems Are Constructible
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1129openalex-snapshot
Integrating Runtime Consistency Models for Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_44openalex-snapshot
Using message semantics to reduce rollback in the time warp mechanism
inferred← citeshttps://doi.org/10.1007/3-540-60042-6_16openalex-snapshot
Sequential consistency in distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_48openalex-snapshot
From causal consistency to sequential consistency in shared memory systems
inferred← citeshttps://doi.org/10.1007/3-540-63343-x_35openalex-snapshot
Building secure and reliable network applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_16openalex-snapshot
Retrofitting Reliability into Complex Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-77610-1_15openalex-snapshot
Operational Characterization of Weak Memory Consistency Models
inferred← citeshttps://doi.org/10.1007/bf01784241openalex-snapshot
Causal memory: definitions, implementation, and programming
inferred← citeshttps://doi.org/10.1007/bf02997620openalex-snapshot
A suite of definitions for consistency criteria in distributed shared memories
inferred← citeshttps://doi.org/10.1007/s00446-004-0106-3openalex-snapshot
Randomized registers and iterative algorithms
inferred← citeshttps://doi.org/10.1007/s004460050014openalex-snapshot
Implementing hybrid consistency with high-level synchronization operations
inferred← citeshttps://doi.org/10.1007/s004460050018openalex-snapshot
Synchronous, asynchronous, and causally ordered communication
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.007openalex-snapshot
On the interconnection of causal memory systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00148-5openalex-snapshot
View consistencies and exact implementations
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)90244-4openalex-snapshot
Linearizable read/write objects
inferred← citeshttps://doi.org/10.1016/s1477-8424(03)00014-9openalex-snapshot
Data-race and concurrent-write freedom are undecidable
inferred← citeshttps://doi.org/10.1023/a:1008116511402openalex-snapshot
A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems
inferred← citeshttps://doi.org/10.1093/comjnl/42.1.24openalex-snapshot
Consistent implementations of replicated objects
inferred← citeshttps://doi.org/10.1093/comjnl/bxp090openalex-snapshot
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory
inferred← citeshttps://doi.org/10.1093/comjnl/bxy142openalex-snapshot
CAP Theorem: Revision of Its Related Consistency Models
inferred← citeshttps://doi.org/10.1109/dexa.2016.035openalex-snapshot
Replica Divergence in Data-Centric Consistency Models
inferred← citeshttps://doi.org/10.1109/empdp.1998.647193openalex-snapshot
Exploiting write semantics in implementing partially replicated causal objects
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617301openalex-snapshot
From serializable to causal transactions for collaborative applications
inferred← citeshttps://doi.org/10.1109/ftdcs.1993.344136openalex-snapshot
How to find his way in the jungle of consistency criteria for distributed shared memories (or how to escape from Minos' labyrinth)
inferred← citeshttps://doi.org/10.1109/hicss.1993.284113openalex-snapshot
An overview of Mermera: a system and formalism for non-coherent distributed parallel memory
inferred← citeshttps://doi.org/10.1109/hicss.1996.495453openalex-snapshot
Data prefetching for distributed shared memory systems
inferred← citeshttps://doi.org/10.1109/hpdc.1994.340252openalex-snapshot
Investigating weak memories using Maya
inferred← citeshttps://doi.org/10.1109/icapp.1996.562896openalex-snapshot
New propositions to improve the efficiency and scalability of DSM systems
inferred← citeshttps://doi.org/10.1109/icdcs.2002.1022285openalex-snapshot
Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918929openalex-snapshot
Applications of probabilistic quorums to iterative algorithms
inferred← citeshttps://doi.org/10.1109/icpp.1993.15openalex-snapshot
A Characterization of Scalable Shared Memories
inferred← citeshttps://doi.org/10.1109/icppw.2002.1039754openalex-snapshot
Specifying synchronization in distributed shared memory programs
inferred← citeshttps://doi.org/10.1109/ipps.1994.288309openalex-snapshot
A framework for programming using non-atomic variables
inferred← citeshttps://doi.org/10.1109/lcn.2009.5355204openalex-snapshot
A scalable cluster distributed BGP architecture for next generation routers
inferred← citeshttps://doi.org/10.1109/wmcsa.1994.19openalex-snapshot
Detecting Mutual Consistency of Shared Objects
inferred← citeshttps://doi.org/10.1137/s0097539794278396openalex-snapshot
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
inferred← citeshttps://doi.org/10.1145/1017460.1017464openalex-snapshot
A unified theory of shared memory consistency
inferred← citeshttps://doi.org/10.1145/1230040.1230071openalex-snapshot
Globally synchronized dead-reckoning with local lag for continuous distributed multiplayer games
inferred← citeshttps://doi.org/10.1145/129712.129778openalex-snapshot
A correctness condition for high-performance multiprocessors (extended abstract)
inferred← citeshttps://doi.org/10.1145/130616.130624openalex-snapshot
On reasoning with the global time assumption
inferred← citeshttps://doi.org/10.1145/140901.141895openalex-snapshot
Specifying non-blocking shared memories (extended abstract)
inferred← citeshttps://doi.org/10.1145/163298.163303openalex-snapshot
The process group approach to reliable distributed computing
inferred← citeshttps://doi.org/10.1145/164051.164077openalex-snapshot
Implementing hybrid consistency with high-level synchronization operations
inferred← citeshttps://doi.org/10.1145/165231.165263openalex-snapshot
Shared memory consistency conditions for non-sequential execution
inferred← citeshttps://doi.org/10.1145/165231.165264openalex-snapshot
The power of processor consistency
inferred← citeshttps://doi.org/10.1145/2333112.2333116openalex-snapshot
Survey of state melding in virtual worlds
inferred← citeshttps://doi.org/10.1145/506378.506387openalex-snapshot
Maintaining consistency in distributed systems
inferred← citeshttps://doi.org/10.1145/584490.584501openalex-snapshot
On the consistency problem in mobile distributed computing
inferred← citeshttps://doi.org/10.5075/epfl-thesis-1903openalex-snapshot
Replication of non-deterministic objects
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.