Publications related to Non Blocking Atomic Commitment with an Unreliable Failure Detector

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.

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

Locking Timestamps versus Locking Objects

Rachid Guerraoui, Junxiong Wang, Tudor Alexandru David

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generi ...

ASSOC COMPUTING MACHINERY2018

How Fast can a Distributed Transaction Commit?

Rachid Guerraoui, Junxiong Wang

The atomic commit problem lies at the heart of distributed database systems. The problem consists for a set of processes (database nodes) to agree on whether to commit or abort a transaction (agreement property). The commit decision can only be taken if al ...

ACM Press2017

Elastic transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

Composing Relaxed Transactions

Rachid Guerraoui, Vincent Gramoli, Mihai Letia

As the classic transactional abstraction is sometimes considered too restrictive in leveraging parallelism, a lot of work has been devoted to devising relaxed transactional models with the goal of improving concurrency. Nevertheless, the quest for improvin ...

IEEE Computer Society2013

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

Scalability of write-ahead logging on multicore and multisocket hardware

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

The shift to multi-core and multi-socket hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization ba ...

2012

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

André Schiper, Zarko Milosevic, Nuno Filipe de Sousa Santos, Martin Biely

Implementations of state machine replication are prevalently using variants of Paxos or other leader-based protocols. Typically these protocols are also leader-centric, in the sense that the leader performs more work than the non-leader replicas. Such prot ...

2012

Non Blocking Atomic Commitment with an Unreliable Failure Detector

Graph Chatbot

Chat with Graph Search

Fast General Distributed Transactions with Opacity

The Complexity of Reliable and Secure Distributed Transactions

Locking Timestamps versus Locking Objects

How Fast can a Distributed Transaction Commit?

How Fast can a Distributed Transaction Commit?

Elastic transactions

Composing Relaxed Transactions

Speculative Linearizability

Scalability of write-ahead logging on multicore and multisocket hardware

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

Fast General Distributed Transactions with Opacity

How Fast can a Distributed Transaction Commit?

How Fast can a Distributed Transaction Commit?

Scalability of write-ahead logging on multicore and multisocket hardware

Speculative Linearizability

The Complexity of Reliable and Secure Distributed Transactions

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

Locking Timestamps versus Locking Objects

Elastic transactions

Composing Relaxed Transactions