Publications related to Transactional memory

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

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

Robustness Against Read Committed: A Free Transactional Lunch

Christoph Koch, Bas Ketsman

Transaction processing is a central part of most database applications. While serializability remains the gold standard for desirable transactional semantics, many database systems offer improved transaction throughput at the expense of introducing potenti ...

ASSOC COMPUTING MACHINERY2022

Robustness against Read Committed for Transaction Templates

Christoph Koch, Bas Ketsman

The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolation of ...

ASSOC COMPUTING MACHINERY2021

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

Task scheduling for highly concurrent analytical and transaction workloads

Anastasia Ailamaki, Iraklis Psaroudakis

Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...

2020

A Shared-Memory Parallel Implementation of the RePlAce Global Cell Placer

Mirjana Stojilovic, Philip Brisk, Frédéric Gessler

RePlAce is a state-of-the-art prototype of a flat, analytic, and nonlinear global cell placement algorithm, which models a placement instance as an electrostatic system with positively charged objects. It can handle large-scale standard-cell and mixed-cell ...

IEEE2020

Efficient Multi-Word Compare and Swap

Rachid Guerraoui, Mihail Igor Zablotchi

Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementations of MCAS make heavy use of expensive compare-and-swap (CAS) instructions ...

Schloss Dagstuhl, Leibniz-Zentrum2020

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

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.

Transactional memory

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

Robustness Against Read Committed: A Free Transactional Lunch

Robustness against Read Committed for Transaction Templates

Performance Characterization of HTAP Workloads

Task scheduling for highly concurrent analytical and transaction workloads

A Shared-Memory Parallel Implementation of the RePlAce Global Cell Placer

Efficient Multi-Word Compare and Swap

Improving Main-memory Database System Performance through Cooperative Multitasking

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

Graph Chatbot

Chat with Graph Search

Efficient Multi-Word Compare and Swap

A Shared-Memory Parallel Implementation of the RePlAce Global Cell Placer

Performance Characterization of HTAP Workloads

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

Improving Main-memory Database System Performance through Cooperative Multitasking

Robustness Against Read Committed: A Free Transactional Lunch

Robustness against Read Committed for Transaction Templates

Task scheduling for highly concurrent analytical and transaction workloads

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