Publications associées à Théorie de l'ordonnancement

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Anastasia Ailamaki, Periklis Chrysogelos, Angelos Christos Anadiotis, Syed Mohammad Aunn Raza

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

ACM2023

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

Christoph Koch, Bas Ketsman

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

ASSOC COMPUTING MACHINERY2023

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 MACHINERY2022

Performance Characterization of HTAP Workloads

Anastasia Ailamaki, Sandhya Dwarkadas, Utku Sirin

Hybrid Transactional and Analytical Processing (HTAP) systems have become popular in the past decade. HTAP systems allow running transactional and analytical processing workloads on the same data and hardware. As a result, they suffer from workload interfe ...

IEEE COMPUTER SOC2021

Resolving bundle-specific intra-axonal T2 values within a voxel using diffusion-relaxation tract-based estimation

Jean-Philippe Thiran, Erick Jorge Canales Rodriguez, Alessandro Daducci, Cristina Granziera, Muhamed Barakovic

At the typical spatial resolution of MRI in the human brain, approximately 60–90% of voxels contain multiple fiber populations. Quantifying microstructural properties of distinct fiber populations within a voxel is therefore challenging but necessary. Whil ...

2020

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

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

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang, Panagiota Fatourou

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

2019

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

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.

Théorie de l'ordonnancement

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

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

Deciding Robustness for Lower SQL Isolation Levels

Performance Characterization of HTAP Workloads

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

Resolving bundle-specific intra-axonal T2 values within a voxel using diffusion-relaxation tract-based estimation

Deciding Robustness for Lower SQL Isolation Levels

Fast General Distributed Transactions with Opacity

Distributed Transactional Systems Cannot Be Fast

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

Graph Chatbot

Chattez avec Graph Search

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

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Performance Characterization of HTAP Workloads

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

Deciding Robustness for Lower SQL Isolation Levels

Deciding Robustness for Lower SQL Isolation Levels

Resolving bundle-specific intra-axonal T2 values within a voxel using diffusion-relaxation tract-based estimation

Distributed Transactional Systems Cannot Be Fast

Fast General Distributed Transactions with Opacity

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