Causal Memory: Definitions, Implementation and Programming

@techreport{citeulike:2067170, abstract = {The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by defining causal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that are causally related. ...}, author = {Ahamad, Mustaque and Hutto, Phillip W. and Neiger, Gil and Burns, James E. and Kohli, Prince }, citeulike-article-id = {2067170}, institution = {Georgia Institute of Technology}, keywords = {consistency, distributed-systems, shared-memory, sharedmemory}, number = {GIT-CC-93/55}, posted-at = {2007-12-06 15:47:30}, priority = {0}, title = {Causal Memory: Definitions, Implementation and Programming}, url = {http://citeseer.ist.psu.edu/64609.html}, year = {1994} }

TY - RPRT ID - citeulike:2067170 L3 - citeulike-article-id:2067170 TI - Causal Memory: Definitions, Implementation and Programming IS - GIT-CC-93/55 N2 - The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by defining causal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that are causally related. ... KW - consistency KW - distributed-systems KW - shared-memory KW - sharedmemory AU - Ahamad, Mustaque AU - Hutto, Phillip AU - Neiger, Gil AU - Burns, James AU - Kohli, Prince PY - 1994/// UR - http://citeseer.ist.psu.edu/64609.html ER -