Publications associées à Comparison of data-serialization formats

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

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

IntegrCiTy - D2.3 Report - Enabling and integrating a common IT structure: Definition of a back-end layer architecture

François Maréchal, Luc Girardin, Jessen Page, Gillian Jean Bernard Basso

The concept of the IntegrCiTy platform is built around the development of a single application as a suite of independent software: project partners will mutualize a certain number of tools that shall be integrated in the IntegrCiTy platform. Therefore, a r ...

IPESE-EPFL2017

Impact of Data Serialization over TSVs on Routing Congestion in 3D-Stacked Multi-Core Processors

Giovanni De Micheli, Yusuf Leblebici, Alessandro Cevrero, Giulia Beanato

3D integration can alleviate routing congestion, reducing the wirelength and improving performances. Nevertheless, each TSV still occupies non-negligible silicon area: as the number of TSV increases, their effect on the chip routing is detrimental. The red ...

Elsevier2016

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

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condit ...

2014

Self-Assembly: Lightweight Language Extension and Datatype Generic Programming, All-in-One!

Heather Christine Klug, Philipp Haller

In this paper we show a general mechanism, called self-assembly, for lightweight language extensions (LLEs). LLEs allow users to define generic operations or properties that operate over a large class of types. With LLEs it is possible, for example, for us ...

2014

Type-based event dissemination

Sébastien Bähni

With the explosion of broadband Internet connections in the late 80s, new types of applications, called distributed applications, came to light. These applications typically seek to provide a user with remote services that appear to that user as if they we ...

EPFL2006