SCsafe: Logging sequential consistency violations continuously and precisely

Duan, Yuelu; Koufaty, David; Torrellas, Josep

doi:10.1109/hpca.2016.7446069

Cited by 11 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since clients can exchange messages with each other and with different replicas, they may see seemingly contradictory information, like missing files, older versions of files they have already updated, or more subtle violations, as discussed in the literature [22,27]. Stronger consistency models provide better guarantees, but are slower, less available, and less scalable, whereas weaker consistency models force programmers to cope with the insufficiencies of the contract.…”

Section: Consistency Trade-offsmentioning

confidence: 99%

Optimal Causal Access in Geo-Replicated Storage Systems

Lima¹,

Araújo

Guerreiro

et al. 2022

Preprint

View full text Add to dashboard Cite

We consider a setting where applications, such as websites or games, need causal access to objects available in geo-replicated cloud data stores. Common ways of implementing causal consistency involve hiding objects while waiting for their dependencies or waiting for server replicas to synchronize. To minimize delays and retrieve objects faster, applications may try to reach different server replicas at once. This entails a cost because providers charge for each reading request, including reading misses where the causal copy of the object is unavailable. Therefore, latency and cost are conflicting goals, which we control by selecting where to read and when. We formulate this challenge as a multi-criteria optimization problem and propose five non-dominated reading strategies to solve it, four of which are Pareto optimal. We validate these solutions on the following real cloud storage services: AWS S3, DynamoDB and MongoDB. Savings of as much as 50% on reading costs, with no significant or even a positive impact on latency, demonstrate that both clients and cloud providers could benefit from richer services compatible with these retrieval strategies.

show abstract

Section: Consistency Trade-offsmentioning

confidence: 99%

Optimal Causal Access in Geo-Replicated Storage Systems

Lima¹,

Araújo

Guerreiro

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Like Peacenik, BulkSMT supports pausing in a non-speculative setting, but provides a consistency guarantee only with respect to the compiled program (serializability of bounded chunks), not an end-to-end guarantee [50]. SCsafe detects dependency cycles due to SC violations or false sharing, in order to enforce SC and log violations of SC [20]. In contrast, Peacenik detects deadlocks that it has introduced by pausing at detected region conflicts.…”

Section: Avoiding Failure Under Fail-stop Semanticsmentioning

confidence: 99%

“…Researchers have sought to provide stronger end-to-end (i.e., with respect to the source program) memory consistency by restricting compiler and hardware optimizations-notably by providing end-to-end SC [5,58,61,64]. (Restricting only hardware [16,20,26,38,39,52] or the compiler [45] fails to provide end-to-end SC. )…”

Section: Introductionmentioning

confidence: 99%

Peacenik

Zhang

Biswas

Balaji

et al. 2020

Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Syste

View full text Add to dashboard Cite

Modern shared-memory systems have erroneous, undefined behavior for programs that are not well synchronized. A promising solution is to provide fail-stop memory consistency, which ensures well-defined behavior for all programs. While fail-stop consistency avoids undefined behavior, it can lead to unexpected failures, imperiling performance or progress.This paper presents architecture support called Peacenik that avoids failures in the context of fail-stop memory consistency. We demonstrate Peacenik by applying Peacenik's general mechanisms to two existing architectures that provide fail-stop consistency. A simulation-based evaluation shows that Peacenik eliminates nearly all of the high costs of fail-stop behavior incurred by the baseline architectures, demonstrating how to get the benefits of fail-stop consistency without incurring most or all of its costs. CCS Concepts. • Computer systems organization → Reliability; Availability; Processors and memory architectures; Multicore architectures; • Software and its engineering → Consistency.

show abstract

“…On average, SoPro incurs a 1.73x overhead over the baseline system when no lock checks are inlined. Several schemes have been proposed for detecting sequential-consistency violations with custom hardware support [18,39,42]. These schemes detect a cycle of data races, which indicates that SC has been compromised, and Figure 11.…”

Section: Optimizationsmentioning

confidence: 99%

Sofritas

et al. 2018

View full text Add to dashboard Cite

Correctly synchronizing multithreaded programs is challenging and errors can lead to program failures such as atomicity violations. Existing strong memory consistency models rule out some possible failures, but are limited by depending on programmer-defined locking code. We present the new Ordering-Free Region (OFR) serializability consistency model that ensures atomicity for OFRs, which are spans of dynamic instructions between consecutive ordering constructs (e.g., barriers), without breaking atomicity at lock operations. Our platform, Serializable Ordering-Free Regions for Increasing Thread Atomicity Scalably (SOFRITAS), ensures a C/C++ program's execution is equivalent to a serialization of OFRs by default. We build two systems that realize the SOFRI-TAS idea: a concurrency bug finding tool for testing called SofriTest, and a production runtime system called SoPro. SofriTest uses OFRs to find concurrency bugs, including a multi-critical-section atomicity violation in memcached that weaker consistency models will miss. If OFRs are too coarse-grained, SofriTest suggests refinement annotations automatically. Our software-only SoPro implementation has high performance, scales well with increased parallelism, and prevents failures despite bugs in locking code. SoPro has an average overhead of just 1.59x on a single-threaded execution and 1.51x on sixteen threads, despite pthreads' much weaker memory model. CCS Concepts • Computer systems organization → Multicore architectures; • Software and its engineering → Runtime environments;

show abstract

SCsafe: Logging sequential consistency violations continuously and precisely

Cited by 11 publications

References 24 publications

Optimal Causal Access in Geo-Replicated Storage Systems

Optimal Causal Access in Geo-Replicated Storage Systems

Peacenik

Sofritas

Contact Info

Product

Resources

About