Concept

Commitment ordering

Related publications (124)

Graph Chatbot

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.

Improving OLTP Concurrency through Early Lock Release

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Since the beginning of the multi-core era, database systems research has restarted focusing on increasing concurrency. Even though database systems have been able to accommodate concurrent requests, the exploding number of available cores per chip has surf ...

2009

Uncertainty Feature Optimization for the Airline Scheduling Problem

Matteo Salani, Niklaus Eggenberg

Uncertainty Feature Optimization is a framework to cope with optimization problems due to noisy data, using an implicit characterazation of the noise. The Aircraft Scheduling Problem (ASP) is a particular case of such problems, where disruptions randomly p ...

2009

Concurrent Programming Paradigms, A Comparison in Scala

Rachid Guerraoui, Martin Odersky, Mohsen Lesani

There is a rapid rise of multi-cores in recent hardware architectures. To exploit computational power of multi-core architectures, software should shift to be as concurrent as possible; and therefore should have concurrency control mechanisms. There are di ...

2009

On the Correctness of Transactional Memory

Rachid Guerraoui, Michal Kapalka

Transactional memory (TM) is perceived as an appealing alternative to critical sections for general purpose concurrent programming. Despite the large amount of recent work on TM implementations, however, very little effort has been devoted to precisely def ...

2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui, Vasu Singh

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first \emph{deterministic} specification automata for strict serializability and ...

Springer2008

Completeness and Nondeterminism in Model Checking Transactional Memories

Rachid Guerraoui, Vasu Singh

Abstract. Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability ...

2008

Partial Snapshot Objects

Rachid Guerraoui, Eric Ruppert, Hagit Albo Attiya

We introduce a generalization of the atomic snapshot object, which we call the partial snapshot object. This object stores a vector of values. Processes may write components of the vector individually or atomically scan any subset of the components. We inv ...

ACM2008

Dynamic Prediction based Scheduling for TM

Anmol Tomar

Transactional memory (TM) provides an intuitive and simple way of writing parallel programs. TMs execute parallel programs speculatively and deliver better performance than conventional lock based parallel programs. However, in certain scenarios when an ap ...

2008

Deferred-update database replication

Rodrigo Malta Schmidt

This thesis is about the design of high-performance fault-tolerant computer systems. More specifically, it focuses on how to develop database systems that behave correctly and with good performance even in the event of failures. Both performance and depend ...

EPFL2008

Toward a Theory of Input Acceptance for Transactional Memories

Vincent Gramoli, Pascal Felber

As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM ...

2008