Results 81 to 90 of about 2,812 (135)

Effective Serializability for Eventual Consistency

open access: yes, 2016
Brutschy, Lucas   +3 more
openaire   +2 more sources

Sequential verification of serializability

ACM SIGPLAN Notices, 2010
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verified by considering only its sequential executions. In many cases, concurrent modules guarantee serializability by using standard locking protocols, such as tree locking or two ...
H. Attiya, G. Ramalingam, N. Rinetzky
exaly   +2 more sources

On serializability

International Journal of Computer & Information Sciences, 1985
Concurrent execution of database transactions is desirable from the point of view of speed, but may introduce inconsistencies. A commonly used criterion of correctness of a concurrent execution of transactions is serializability, i.e., the equivalence of the execution to some serial schedule or schedules.
Brzozowski, J. A., Muro, S.
exaly   +2 more sources

Serializability by commitment ordering

Information Processing Letters, 1994
Abstract A new serializability concept, Commitment Ordering (CO), allows to effectively achieve global serializability across multiple autonomous Database Systems, that may use different (any) concurrency control mechanisms. CO generalizes the popular Strong-Strict Two Phase Locking (S-S2PL) concept.
exaly   +3 more sources

Serializable eventual consistency

Proceedings of the 2nd Workshop on the Principles and Practice of Consistency for Distributed Data, 2016
In order to allow offline functionality of (mobile) web applications, state needs to be optimistically replicated and synchronized whenever connection is re-established. We present a programming language solution that provides replicated application state in a cloud-client setting.
Tim Coppieters   +2 more
openaire   +1 more source

Serializability by Locking

Journal of the ACM, 1984
The power of locking as a primitive for controlling concurrency in database systems is examined. It is accepted that the concurrent execution (or schedule) of different transactions must be serializable; that is, it must behave like a serial schedule, one in which the transactions run one at a time.
openaire   +1 more source

Home - About - Disclaimer - Privacy