Preventing versus Curing: Avoiding Conflicts in Transactional Memories

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing se ...

Predicting the effects of mutations on protein stability is a key problem in fundamental and applied biology, still unsolved even for the relatively simple case of small, soluble, globular, monomeric, two-state-folder proteins. Many articles discuss the li ...

Modern large-scale data platforms manage colossal amount of data, generated by the ever-increasing number of concurrent users. Geo-replicated and sharded key-value data stores play a central role when building such platforms. As the strongest consistency m ...

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generi ...

The increase in the number of cores in processors has been an important trend over the past decade. In order to be able to efficiently use such architectures, modern software must be scalable: performance should increase proportionally to the number of all ...

There is a trend towards increased specialization of data management software for performance reasons. The improved performance not only leads to a more efficient usage of the underlying hardware and cuts the operation costs of the system, but also is a ga ...

The correctness of a shared object, which can be accessed by several processes concurrently, is specified through two different kinds of properties - safety and liveness. When implementing a shared object it is important to specify its correctness in a suc ...

Model-based data-interpretation techniques are increasingly used to improve the knowledge of complex system behavior. Physics-based models that are identified using measurement data are generally used for extrapolation to predict system behavior under othe ...

Recent studies highlight that traditional transaction processing systems utilize the micro-architectural features of modern processors very poorly. L1 instruction cache and long-latency data misses dominate execution time. As a result, more than half of th ...

The pressure drops of external flow over enhanced tube bundles were experimentally obtained at both adiabatic and diabatic conditions using R-134a and R-236fa as test fluids. The tests were carried out at saturation temperatures of 5 and 15 degrees C, mass ...

The shift to multi-core and multi-socket hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization ba ...

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

A new method to predict the void fraction in annular two-phase flow in macroscale and microscale channels is presented. The underlying experimental database contains 2673 data points collected from 29 different literature studies for 8 different gas-liquid ...

The shift to multi-core hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization barriers serialize ...

Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that acce ...

Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, an ...

Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts strongly the performance and scalability of these applications: spinning provides ...

The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user to augment a base processor with instruction set extensions (ISEs) that exec ...

Preventing versus Curing: Avoiding Conflicts in Transactional Memories

Chat with Graph Search

When is it safe to run a transactional workload under Read Committed?

Reviewing Challenges of Predicting Protein Melting Temperature Change Upon Mutation Through the Full Analysis of a Highly Detailed Dataset with High-Resolution Structures

Efficient Protocols for Enforcing Causal Consistency in Geo-Replicated Key-Value Data Stores

Fast General Distributed Transactions with Opacity

Distributed Transactional Systems Cannot Be Fast

Locking Timestamps versus Locking Objects

Universally Scalable Concurrent Data Structures

Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

Safety, Liveness and Parallelism in Concurrent Computing

Robust system identification and model predictions in the presence of systematic uncertainty

ADDICT: Advanced Instruction Chasing for Transactions

Pressure drop data and prediction method for enhanced external boiling tube bundles with R-134a and R-236fa

Scalability of write-ahead logging on multicore and multisocket hardware

Speculative Linearizability

Void fraction prediction in annular two-phase flow

Aether: A scalable approach to logging

Transactions in the Jungle

Theory of Transactional Memory

Decoupling contention management from scheduling

Fast, Nearly Optimal ISE Identification with I/O Serialization through Maximal Clique Enumeration