A Topological Treatment of Early-Deciding Set-Agreement
Guerraoui, Rachid; Herlihy, Maurice; Pochon, Bastian
2009

Files

Abstract

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem.

Details

Title A Topological Treatment of Early-Deciding Set-Agreement
Author(s) Guerraoui, Rachid ; Herlihy, Maurice ; Pochon, Bastian
Published in Theoretical Computer Science
Volume 410
Issue 6-7
Pages 570-580
Date 2009
Keywords
DOI https://doi.org/10.1016/j.tcs.2008.10.002
Other identifier(s) View record in Web of Science
Laboratories DCL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > DCL - Distributed Computing Laboratory
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2008-06-11

Actions

Preview