scispace - formally typeset
R

Rachid Guerraoui

Researcher at École Polytechnique Fédérale de Lausanne

Publications -  603
Citations -  23263

Rachid Guerraoui is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Computer science & Distributed algorithm. The author has an hindex of 66, co-authored 565 publications receiving 21306 citations. Previous affiliations of Rachid Guerraoui include École Polytechnique & École Normale Supérieure.

Papers
More filters
Journal ArticleDOI

The many faces of publish/subscribe

TL;DR: This paper factors out the common denominator underlying these variants: full decoupling of the communicating entities in time, space, and synchronization to better identify commonalities and divergences with traditional interaction paradigms.
Proceedings Article

Machine learning with adversaries: byzantine tolerant gradient descent

TL;DR: Krum is proposed, an aggregation rule that satisfies the resilience property of the aggregation rule capturing the basic requirements to guarantee convergence despite f Byzantine workers, which is argued to be the first provably Byzantine-resilient algorithm for distributed SGD.
Journal ArticleDOI

Gossip-based peer sampling

TL;DR: This paper presents a generic framework to implement a peer-sampling service in a decentralized manner by constructing and maintaining dynamic unstructured overlays through gossiping membership information itself, which generalizes existing approaches and makes it easy to discover new ones.
Journal ArticleDOI

Epidemic information dissemination in distributed systems

TL;DR: Four key problems: membership maintenance, network awareness, buffer management,buffer management, and message filtering are described and some preliminary approaches to address them are suggested.
Journal ArticleDOI

Lightweight probabilistic broadcast

TL;DR: This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional probabilism broadcast algorithms with a scalable memory management technique.