Publications related to Mutual exclusion

OneFile: A Wait-free Persistent Transactional Memory

A persistent transactional memory (PTM) library provides an easy-to-use interface to programmers for using byte-addressable non-volatile memory (NVM). Previously proposed PTMs have, so far, been blocking. We present OneFile, the first wait-free PTM with in ...

IEEE COMPUTER SOC2019

State Machine Replication is More Expensive than Consensus

Rachid Guerraoui, Dragos-Adrian Seredinschi, Karolos Antoniadis

Consensus and State Machine Replication (SMR) are generally considered to be equivalent problems. In certain system models, indeed, the two problems are computationally equivalent: any solution to the former problem leads to a solution to the latter, and v ...

2018

ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications

Rachid Guerraoui, Aleksandar Dragojevic, Georgios Chatzopoulos

This article presents ESTIMA, an easy-to-use tool for extrapolating the scalability of in-memory applications. ESTIMA is designed to perform a simple yet important task: Given the performance of an application on a small machine with a handful of cores, ES ...

2017

Locking Made Easy

Rachid Guerraoui, Vasileios Trigonakis, Georgios Chatzopoulos, Jelena Antic

A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to lock before accessing the data and unlock after. Nevertheless, making locking efficient requires fine-tuning (a) the granularity of locks and (b) the locking ...

ACM Press2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

2016

Right On Time Distributed Shared Memory

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

The demand for real-time data storage in distributed control systems (DCSs) is growing. Yet, providing real- time DCS guarantees is challenging, especially when more and more sensor and actuator devices are connected to industrial plants and message loss n ...

2016

Dataflow Programs Analysis and Optimization Using Model Predictive Control Techniques. Two Examples of Bounded Buffer Scheduling: Deadlock Avoidance and Deadlock Recovery Strategies

Marco Mattavelli, Simone Casale Brunet, Endri Bezati

The analysis of the trace graphs generated by dataflow program executions has been shown to be an effective tool for exploring and optimizing the design space of application programs on manycore/multicore platforms. In this work a new approach aiming at fi ...

Springer2015

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.

Mutual exclusion

OneFile: A Wait-free Persistent Transactional Memory

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

State Machine Replication is More Expensive than Consensus

ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications

Locking Made Easy

Fast and Robust Memory Reclamation for Concurrent Data Structures

Fast and Robust Memory Reclamation for Concurrent Data Structures

Right On Time Distributed Shared Memory

Dataflow Programs Analysis and Optimization Using Model Predictive Control Techniques. Two Examples of Bounded Buffer Scheduling: Deadlock Avoidance and Deadlock Recovery Strategies

Graph Chatbot

Chat with Graph Search

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

OneFile: A Wait-free Persistent Transactional Memory

State Machine Replication is More Expensive than Consensus

ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications

Locking Made Easy

Fast and Robust Memory Reclamation for Concurrent Data Structures

Right On Time Distributed Shared Memory

Dataflow Programs Analysis and Optimization Using Model Predictive Control Techniques. Two Examples of Bounded Buffer Scheduling: Deadlock Avoidance and Deadlock Recovery Strategies

Fast and Robust Memory Reclamation for Concurrent Data Structures