Shaz Qadeer (August 2003). “Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking”. IEEE Transactions on Parallel and Distributed Systems14 (8): 730–741. arXiv:cs/0108016. doi:10.1109/TPDS.2003.1225053.
Steinke, Robert C.; Gary J. Nutt (2004). “A unified theory of shared memory consistency.”. Journal of the ACM51 (5): 800–849. arXiv:cs/0208027. doi:10.1145/1017460.1017464.
cloudera-todd.s3.amazonaws.com
Todd Lipcon (2014年10月25日). “Design Patterns for Distributed Non-Relational Databases”. 2011年3月24日閲覧。 “A consistency model determines rules for visibility and apparent order of updates. Example: * Row X is replicated on nodes M and N * Client A writes row X to node N * Some period of time t elapses. * Client B reads row X from node M * Does client B see the write from client A? Consistency is a continuum with tradeoffs”
Shaz Qadeer (August 2003). “Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking”. IEEE Transactions on Parallel and Distributed Systems14 (8): 730–741. arXiv:cs/0108016. doi:10.1109/TPDS.2003.1225053.
Lamport, Leslie (Sep 1979). “How to make a multiprocessor computer that correctly executes multiprocess programs.”. IEEE Transactions on ComputersC-28 (9): 690–691. doi:10.1109/TC.1979.1675439.
Steinke, Robert C.; Gary J. Nutt (2004). “A unified theory of shared memory consistency.”. Journal of the ACM51 (5): 800–849. arXiv:cs/0208027. doi:10.1145/1017460.1017464.
Hutto, Phillip W.; Mustaque Ahamad (1990). Slow memory: Weakening consistency to enhance concurrency in distributed shared memories.. 302–309. doi:10.1109/ICDCS.1990.89297. ISBN978-0-8186-2048-5
Herlihy, Maurice P.; Jeannette M. Wing (July 1990). “"Linearizability: A correctness condition for concurrent objects." ACM Transactions on Programming Languages and Systems”. ACM Transactions on Programming Languages and Systems12 (3): 463–492. doi:10.1145/78969.78972.