Publication
Formalizing and verifying transactional memories
Publications associées (57)
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 ...
ACM2023Vision Transformer Adapters for Generalizable Multitask Learning
Sabine Süsstrunk, Mathieu Salzmann, Deblina Bhattacharjee
We introduce the first multitasking vision transformer adapters that learn generalizable task affinities which can be applied to novel tasks and domains. Integrated into an off-the-shelf vision transformer backbone, our adapters can simultaneously solve mu ...
2023Concurrency control for database theorists
The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation. ...
ASSOC COMPUTING MACHINERY2022Improving Main-memory Database System Performance through Cooperative Multitasking
Database systems access memory either sequentially or randomly. Contrary to sequential access and despite the extensive efforts of
computer architects, compiler writers, and system builders, random access to data larger than the processor cache has been s ...
EPFL2019PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the syn ...
IEEE COMPUTER SOC2019The 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 MACHINERY2019Universally Scalable Concurrent Data Structures
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 ...
EPFL2017The Operational Semantics and Implementation of a Core Dart language
In this report we present the specification of the operational semantics of Dart Kernel and a reference implementation of Dart Kernel in Dart. We design a CESK-like machine to specify the operational semantics of Dart Kernel and we implement an interpreter ...
2017Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads
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 ...
EPFL2017Exogenous 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