Reconfigurable Sequential Consistency Algorithm
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04
Reconfigurable Object Consistency Model
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Reconfigurable Consistency Algorithm
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
Journal of Systems and Software
Implementing sequentially consistent programs on processor consistent platforms
Journal of Parallel and Distributed Computing
Causally ordered delivery in a hierarchical group of peer processes
Computer Communications
Reconfigurable object consistency model for distributed shared memory
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Allowing atomic objects to coexist with sequentially consistent objects
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
Sequential consistency is a consistency criterion for concurrent objects stating that the execution of a multiprocess program is correct if it could have been produced by executing the program on a mono-processor system, preserving the order of the operations of each individual process. Several protocols implementing sequential consistency on top of asynchronous distributed systems have been proposed. They assume that the processes access the shared objects through basic read and write operations. This paper considers the case where the processes can invoke multi-object operations which can read or write several objects in a single operation atomically. It proposes a particularly simple protocol that guarantees sequentially consistent executions in such a context. The previous sequential consistency protocols, in addition to considering only unary operations, assume either full replication or a central manager storing copies of all the objects. In contrast, the proposed protocol has the noteworthy feature that each object has a separate manager. Interestingly, this provides the protocol with a versatility dimension that allows deriving simple protocolsproviding sequential consistency or atomic consistency when each operation is on a single object.