Share This Author
The many faces of publish/subscribe
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.
Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent
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.
On the correctness of transactional memory
Opacity is defined as a property of concurrent transaction histories and its graph theoretical interpretation is given and it is proved that every single-version TM system that uses invisible reads and does not abort non-conflicting transactions requires, in the worst case, k steps for an operation to terminate.
Gossip-based peer sampling
- M. Jelasity, S. Voulgaris, R. Guerraoui, Anne-Marie Kermarrec, M. V. Steen
- Computer ScienceTOCS
- 1 August 2007
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.
Lightweight probabilistic broadcast
- P. Eugster, R. Guerraoui, S. Handurukande, P. Kuznetsov, Anne-Marie Kermarrec
- Computer ScienceInternational Conference on Dependable Systems…
- 1 July 2001
Lightweight Probabilistic Broadcast is presented, a novel gossip-based broadcast algorithm which preserves the inherent throughput scalability of traditional gossip- based algorithms and adds a notion of membership management scalability: every process only knows a random subset of fixed size of the processes in the system.
The Hidden Vulnerability of Distributed Learning in Byzantium
Bulyan is introduced, and it is empirically show that Bulyan does not suffer the fragility of existing aggregation rules and, at a reasonable cost in terms of required batch size, achieves convergence as if only non-Byzantine gradients had been used to update the model.
The Next 700 BFT Protocols
- R. Guerraoui
- Computer ScienceOPODIS
- 15 December 2008
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…
Stretching transactional memory
SwissTM is lock- and word-based and uses a new two-phase contention manager that ensures the progress of long transactions while inducing no overhead on short ones, and outperforms state-of-the-art STM implementations, namely RSTM, TL2, and TinySTM.
Introduction to Reliable and Secure Distributed Programming
The authors follow an incremental approach by first introducing basic abstractions in simple distributed environments, before moving to more sophisticated abstractions and more challenging environments, and each core chapter is devoted to one topic, covering reliable broadcast, shared memory, consensus, and extensions of consensus.
STMBench7: a benchmark for software transactional memory
STMBench7 is presented: a candidate benchmark for evaluating STM implementations and illustrated with an evaluation of a well-known software transactional memory implementation.