Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Serializability with constraints
ACM Transactions on Database Systems (TODS)
Scalable Consistency Protocols for Distributed Services
IEEE Transactions on Parallel and Distributed Systems
The Theory of Database Concurrency Control
The Theory of Database Concurrency Control
Sequential consistency as lazy linearizability
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
From Causal Consistency to Sequential Consistency in Shared Memory Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Sequential Consistency in Distributed Systems
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
An Adaptive Protocol for Implementing Causally Consistent Distributed Services
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A Distributed Implementation of Sequential Consistency with Multi-Object Operations
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
| Hi-index | 0.00 |
A concurrent object is an object that can be concurrently accessed by several processes. Two well known consistency criteria for such objects are atomic consistency (also called linearizability) and sequential consistency. Both criteria require that all the operations on all the concurrent objects be totally ordered in such a way that each read operation obtains the last value written into the corresponding object. They differ in the meaning of the word ”last” that refers to physical time for atomic consistency, and to logical time for sequential consistency. This paper investigates the merging of these consistency criteria. It presents a protocol that allows the upper layer multiprocess program to use simultaneously both types of consistency: purely atomic objects can coexist with purely sequentially consistent objects. The protocol is built on top of a message passing asynchronous distributed system. Interestingly, this protocol is generic in the sense that it can be tailored to provide only one of these consistency criteria