Publications associées à Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

RetroWrite: Statically Instrumenting COTS Binaries for Fuzzing and Sanitization

Mathias Josef Payer, Duo Xu

Analyzing the security of closed source binaries is currently impractical for end-users, or even developers who rely on third-party libraries. Such analysis relies on automatic vulnerability discovery techniques, most notably fuzzing with sanitizers enable ...

IEEE COMPUTER SOC2020

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...

ASSOC COMPUTING MACHINERY2020

Fast General Distributed Transactions with Opacity

Aleksandar Dragojevic, Stanko Novakovic, Georgios Chatzopoulos

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 ...

ASSOC COMPUTING MACHINERY2019

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...

ASSOC COMPUTING MACHINERY2019

Locking Timestamps versus Locking Objects

Rachid Guerraoui, Junxiong Wang, Tudor Alexandru David

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 ...

ASSOC COMPUTING MACHINERY2018

Locking Timestamps Versus Locking Objects

Rachid Guerraoui, Tudor Alexandru David

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple and novel: lock individual time points instead of locking objects or versions. Af ...

2017

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

Exogenous Coordination of Concurrent Software Components with JavaBIP

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

A strong separation of concerns is necessary in order to make the design of domain-specific functional components independent from cross-cutting concerns, such as concurrent access to the shared resources of the execution platform. Native coordination mech ...

Wiley-Blackwell2017

Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

Graph Chatbot

Chattez avec Graph Search

RetroWrite: Statically Instrumenting COTS Binaries for Fuzzing and Sanitization

Deciding Robustness for Lower SQL Isolation Levels

Fast General Distributed Transactions with Opacity

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Locking Timestamps versus Locking Objects

A Scale-out Blockchain for Value Transfer with Spontaneous Sharding

Universally Scalable Concurrent Data Structures

Locking Timestamps Versus Locking Objects

Elastic transactions

Exogenous Coordination of Concurrent Software Components with JavaBIP

Elastic transactions

Locking Timestamps versus Locking Objects

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Fast General Distributed Transactions with Opacity

Deciding Robustness for Lower SQL Isolation Levels

A Scale-out Blockchain for Value Transfer with Spontaneous Sharding

Universally Scalable Concurrent Data Structures

RetroWrite: Statically Instrumenting COTS Binaries for Fuzzing and Sanitization

Locking Timestamps Versus Locking Objects

Exogenous Coordination of Concurrent Software Components with JavaBIP