On the Scalability of Snapshot Isolation

Ardekani, Masoud Saeida; Sutra, Pierre; Shapiro, Marc; Preguiça, Nuno

doi:10.1007/978-3-642-40047-6_39

Cited by 20 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result was refined by Saeida Ardekani et al [15], who proved that monotonic snapshots are not compatible with genuine partial replication (defined shortly).…”

Section: A Scalability Limits Of Psimentioning

confidence: 79%

“…Hence, we assume it in Table II(b). Saeida Ardekani et al [15,Theorems 2 and 4] show that none of SSER, SER, SI and PSI are implementable under GPR when queries are wait-free and update transactions are obstruction free. Peluso et al [11] show that US can combine GPR and wait-free queries.…”

Section: B Comparison To Other Criteriamentioning

confidence: 98%

“…The code of all the protocols, benchmarks, and scripts we used in the experiments are publicly available [31].…”

Section: B Setup and Benchmarkmentioning

confidence: 99%

See 2 more Smart Citations

Non-monotonic Snapshot Isolation: Scalable and Strong Consistency for Geo-replicated Transactional Systems

Ardekani

Sutra

Shapiro

2013

2013 IEEE 32nd International Symposium on Reliable Distributed Systems

Self Cite

View full text Add to dashboard Cite

Modern cloud systems are geo-replicated to improve application latency and availability. Transactional consistency is essential for application developers; however, the corresponding concurrency control and commitment protocols are costly in a geo-replicated setting. To minimize this cost, we identify the following essential scalability properties: (i) only replicas updated by a transaction T make steps to execute T ; (ii) a read-only transaction never waits for concurrent transactions and always commits; (iii) a transaction may read object versions committed after it started; and (iv) two transactions synchronize with each other only if their writes conflict. We present Non-Monotonic Snapshot Isolation (NMSI), the first strong consistency criterion to allow implementations with all four properties. We also present a practical implementation of NMSI called Jessy, which we compare experimentally against a number of well-known criteria. Our measurements show that the latency and throughput of NMSI are comparable to the weakest criterion, read-committed, and between two to fourteen times faster than well-known strong consistencies.

show abstract

“…This result was refined by Saeida Ardekani et al [15], who proved that monotonic snapshots are not compatible with genuine partial replication (defined shortly).…”

Section: A Scalability Limits Of Psimentioning

confidence: 79%

Section: B Comparison To Other Criteriamentioning

confidence: 98%

See 1 more Smart Citation

Non-monotonic Snapshot Isolation: Scalable and Strong Consistency for Geo-replicated Transactional Systems

Ardekani

Sutra

Shapiro

2013

2013 IEEE 32nd International Symposium on Reliable Distributed Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In that case, however, the group communication primitive only ensures a pair-wise ordering of the transactions [40], i.e., two processes only deliver transactions they have in common in the same order (line 4). This design tends to increase the scalability of the multicast primitive, but comes at the price of the following drawbacks: (i) More aborts because an update transaction commits only if there is no concurrent conflicting committed transaction (line 7), and (ii) Saeida Ardekani et al [50] proved that no GPR system under SER can ensure WFQ. Thus, S-DUR needs to perform some background propagation to all replicas (line 8).…”

Section: Serializabilitymentioning

confidence: 97%

G-Dur

Ardekani¹,

Sutra

Shapiro³

2014

Proceedings of the 15th International Middleware Conference on - Middleware '14

Self Cite

View full text Add to dashboard Cite

A large family of distributed transactional protocols have a common structure, called Deferred Update Replication (DUR). DUR provides dependability by replicating data, and performance by not re-executing transactions but only applying their updates. Protocols of the DUR family differ only in behaviors of few generic functions. Based on this insight, we offer a generic DUR middleware, called G-DUR, along with a library of finely-optimized plug-in implementations of the required behaviors. This paper presents the middleware, the plugins, and an extensive experimental evaluation in a geo-replicated environment. Our empirical study shows that: (i) G-DUR allows developers to implement various transactional protocols under 600 lines of code; (ii) It provides a fair, apples-to-apples comparison between transactional protocols; (iii) By replacing plugs-ins, developers can use G-DUR to understand bottlenecks in their protocols; (iv) This in turn enables the improvement of existing protocols; and (v) Given a protocol, G-DUR helps evaluate the cost of ensuring various degrees of dependability.

show abstract

“…In TM computing, snapshot isolation has been studied in [4,13,33,34]. An STM algorithm, called SI-STM, which ensures snapshot isolation is presented in [33].…”

Section: Related Workmentioning

confidence: 99%

The PCL theorem

Bushkov

Dziuma

Fatourou

et al. 2014

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condition, called weak adaptive consistency, introduced here and which is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and very little liveness, i.e. that transactions eventually commit if they run solo.

show abstract

On the Scalability of Snapshot Isolation

Cited by 20 publications

References 23 publications

Non-monotonic Snapshot Isolation: Scalable and Strong Consistency for Geo-replicated Transactional Systems

Non-monotonic Snapshot Isolation: Scalable and Strong Consistency for Geo-replicated Transactional Systems

G-Dur

The PCL theorem

Contact Info

Product

Resources

About