Hagit Attiya, Rachid Guerraoui
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...
Frey, Davide, Guerraoui, Rachid, Kermarrec, Anne-Marie, Koldehofe, Boris, Mogensen, Martin, Monod, Maxime, ...
ACM SIGACT News Distributed Computing Column 10 (2009)
Sergio Rajsbaum, Deconstructing Paxos, Romain Boichat, Partha Dutta, Svend Frølund, Rachid Guerraoui
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases,...
Modern Security with Traditional Distributed Algorithms (2009)
Rachid Guerraoui, Marko Vukolić
Security modules and omission failures Several manufacturers have recently started to equip their hardware with security modules. These typically consist of smart cards or special microprocessors....
Decentralized Polling With Respectable Participants (2009)
Guerraoui, Rachid, Huguenin, Kévin, Kermarrec, Anne-Marie, Maxime Monod, Maxime
We consider the polling problem in a social network where respectable participants do care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be...
The Disagreement Power of an Adversary (2009)
Delporte-Gallet, Carole, Fauconnier, Hugues, Guerraoui, Rachid, Tielmann, Andreas
At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where $t$ processes can crash is exactly...
LiFT: Lightweight Freerider-Tracking Protocol (2009)
Guerraoui, Rachid, Huguenin, Kévin, Kermarrec, Anne-Marie, Maxime Monod, Maxime
This paper addresses the problem of detecting freeriders in eer-to-peer epidemic content dissemination applications, such as gossip-based and mesh-based systems. We present LiFT, a Lightweight...
Transactions in the Jungle (2009)
Guerraoui, Rachid, Henzinger, Thomas, Kapalka, Michal, Singh, Vasu
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. However, the semantics of interactions between transactions managed by a TM and non-transactional...
Frey, Davide, Guerraoui, Rachid, Kermarre, Anne-Marie, Koldehofe, Boris, Mogensen, Martin, Monod, Maxime, ...
Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is...
Felber, Pascal, Gramoli, Vincent, Guerraoui, Rachid
This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate transaction that...
Reflexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications (2009)
Spring, Jesper Honig, Pizlo, Filip, Guerraoui, Rachid, Vitek, Jan
How robust are gossip-based communication protocols? (2007)
Alvisi, Lorenzo, Doumen, Jeroen, Guerraoui, Rachid, Koldehofe, Boris, Li, Harry, Van Renesse, Robbert, ...
Gossip-based communication protocols are often touted as being robust. Not surprisingly, such a claim relies on assumptions under which gossip protocols are supposed to operate. In this paper, we...
Towards Fair Event Dissemination (2007)
Baehni, Sebastien, Guerraoui, Rachid, Koldehofe, Boris, Monod, Maxime
Event dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every participant in the system...
On the weakest failure detector ever (2007)
Rachid Guerraoui, Petr Kouznetsov, Maurice Herlihy, Nancy Lynch, Calvin Newport
Many problems in distributed computing are impossible when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to...
The Alpha of Indulgent Consensus (2007)
Guerraoui, Rachid, Raynal, Michel
This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus...
The Alpha of Indulgent Consensus (2006)
Guerraoui, Rachid, Raynal, Michel
This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus...
The impossibility of boosting distributed service resilience (2005)
Paul Attie, Rachid Guerraoui, Petr Kouznetsov, Nancy Lynch, Sergio Rajsbaum
We study f-resilient services which are guaranteed to operate as long as no more than f of the associated processes fail. We prove two theorems about the impossibility of boosting the resilience of...
Mobilité et bases de données - Etat de l'art et perspectives (2003)
Bernard, Guy, Ben-Othman, Jalel, Bouganim, Luc, Canals, Gérôme, Defude, Bruno, Ferrié, Jean, ...
Ce document est le résultat d'un travail collectif réalisé par les membres de l'action spécifique CNRS « Mobilité/Accès aux données ». Il fait le point sur l'état d'avancement des travaux...
Mobilité et bases de données - Etat de l'art et perspectives (2003)
Bernard, Guy, Ben-Othman, Jalel, Bouganim, Luc, Canals, Gérôme, Defude, Bruno, Ferrié, Jean, ...
Ce document est le résultat d'un travail collectif réalisé par les membres de l'action spécifique CNRS « Mobilité/Accès aux données ». Il fait le point sur l'état d'avancement des travaux...
Object-Oriented Abstractions for Distributed Programming (0000)
The article focuses on object-oriented (OO) abstractions for distributed programming. There are as many definitions of the object-oriented programming paradigm as there is literature trying to define...
OO Distributed Programming Is Not Distributed OO Programming (0000)
Object-oriented (OO) distributed programming is fundamentally different from building mechanisms that hide remote invocations behind traditional, centralized abstractions. The metaphor of a community...