Recherche

Afficher tous les résultats pour

Accueil

Personne

Rachid Guerraoui

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (292)

Unlocking Energy

Rachid Guerraoui, Babak Falsafi, Javier Picorel Obando, Vasileios Trigonakis

Locks are a natural place for improving the energy efficiency of software systems. First, concurrent systems are mainstream and when their threads synchronize, they typically do it with locks. Second, locks are well-defined abstractions, hence changing the ...

Usenix Assoc2016

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

Frugal Topology Construction for Stream Aggregation in the Cloud

Rachid Guerraoui, Bao Duy Tran, Rhicheek Patra

Aggregation of streamed data is key to the expansion of the Internet of Things. This paper addresses the problem of designing a topology for reliably aggregating data flows from many devices arriving at a datacenter. Reliability here means ensuring operati ...

Ieee2016

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Rachid Guerraoui, Tudor Alexandru David

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and ...

ACM2016

When Neurons Fail - Technical Report

Rachid Guerraoui, El Mahdi El Mhamdi

Neural networks have been traditionally considered robust in the sense that their precision degrades gracefully with the failure of neurons and can be compensated by additional learning phases. Nevertheless, critical applications for which neural networks ...

EPFL2016

Optimal Fair Computation

Rachid Guerraoui, Junxiong Wang

Springer Berlin Heidelberg2016

Never Say Never Probabilistic & Temporal Failure Detectors

Rachid Guerraoui, David Kozhaya

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building b ...

Ieee2016

ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications

Rachid Guerraoui, Aleksandar Dragojevic, Georgios Chatzopoulos

This paper 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, EST ...

ACM Press2016

Locking Made Easy

Rachid Guerraoui, Vasileios Trigonakis, Jelena Antic, Georgios Chatzopoulos

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

WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems

Rachid Guerraoui, David Kozhaya

To increase their dependability, distributed control systems (DCSs) need to agree in real time about crashed hosts, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministically if, besi ...

Ieee2016

Special issue on NETYS selected papers

Rachid Guerraoui, Vincent Gramoli

Springer Wien2015

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes ...

Association for Computing Machinery2015

A Thrifty Universal Construction

Rachid Guerraoui, Cheng Wang

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...

2015

D2P: Distance-Based Differential Privacy in Recommenders

Rachid Guerraoui, Anne-Marie Kermarrec, Rhicheek Patra, Mahsa Taziki

The upsurge in the number of web users over the last two decades has resulted in a significant growth of online information. This information growth calls for recommenders that personalize the in- formation proposed to each individual user. Nevertheless, p ...

Assoc Computing Machinery2015

Safety-Liveness Exclusion in Distributed Computing

Rachid Guerraoui, Victor Bushkov

The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an a ...

ACM2015

To Transmit Now or Not to Transmit Now

Rachid Guerraoui, David Kozhaya

IEEE2015

Byzantine Fireflies

Rachid Guerraoui, Alexandre David Olivier Maurer

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We a ...

2015

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Rachid Guerraoui, Tudor Alexandru David, Vasileios Trigonakis

We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...

2015

A paradox of eventual linearizability in shared memory

Rachid Guerraoui, Eric Ruppert

This paper compares, for the rst time, the computational power of linearizable objects with that of eventually linearizable ones. We present the following paradox. We show that, unsurprisingly, no set of eventually linearizable objects can (1) implement an ...

ACM Press2014

Page 8 sur 15