Zobrazeno 1 - 10 of 72 pro vyhledávání: '"Bastian Pochon"'
1
The Complexity of Early Deciding Set Agreement
Autor: Rachid Guerraoui, Bastian Pochon, Eli Gafni
Publikováno v: SIAM Journal on Computing. 40:63-78
In the $k$-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most $k$ distinct output values may be chosen, and every processor's output value must be one of the proposed values. We
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3dde0e2eb488b7b8fa493136eacf08c
https://doi.org/10.1137/050640746
Zobrazit plný text záznamu
2
Throughput optimal total order broadcast for cluster environments
Autor: Rachid Guerraoui, Ron R. Levy, Vivien Quéma, Bastian Pochon
Publikováno v: ACM Transactions on Computer Systems
ACM Transactions on Computer Systems, Association for Computing Machinery, 2010
ACM Transactions on Computer Systems, 2010
Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide range of services. This article studies the practical performance of such a primitive on a cluster o
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::451dfce480bc2339a415bd67bb1ec2f6
https://doi.org/10.1145/1813654.1813656
Zobrazit plný text záznamu
3
The Complexity of Early Deciding Set Agreement: How can Topology help?
Autor: Bastian Pochon, Rachid Guerraoui
Publikováno v: Electronic Notes in Theoretical Computer Science. 230:71-78
The aim of this paper is to pose a challenge to the experts of (algebraic) topology techniques. We present an early deciding algorithm that solves the set agreement problem, i.e., the problem which triggered research on applying topology techniques t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99d2a545a4198cd84f2e6eb3fac015da
https://doi.org/10.1016/j.entcs.2009.02.017
Zobrazit plný text záznamu
4
The perfectly synchronized round-based model of distributed computing
Autor: Rachid Guerraoui, Bastian Pochon, Carole Delporte-Gallet, Hugues Fauconnier
Publikováno v: Information and Computation
Information and Computation, Elsevier, 2005, Volume 205 (Issue 5,), pp.783-815
The perfectly synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy. We describe a technique to automatically tra
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b11243da41f3d96b78e45d8e0ac62f6c
https://doi.org/10.1016/j.ic.2006.11.003
Zobrazit plný text záznamu
5
The Time-Complexity of Local Decision in Distributed Agreement
Autor: Partha Dutta, Rachid Guerraoui, Bastian Pochon
Publikováno v: SIAM Journal on Computing. 37:722-756
Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed agreement problems is generally measured in terms of
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e66089c414b8bd27bad171a6ffd5dfa
https://doi.org/10.1137/s0097539704446220
Zobrazit plný text záznamu
6
A Note on Set Agreement with Omission Failures1 1This work is partially supported by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322
Autor: Petr Kouznetsov, Bastian Pochon, Rachid Guerraoui
Publikováno v: Electronic Notes in Theoretical Computer Science. 81:48-58
This paper considers the k-set agreement problem in a synchronous distributed system model with send-omission failures in which at most f processes can fail by send-omission. We show that, in a system of n+1 processes (n+1) f), no algorithm can solve
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2f66135a3d8892246dd82662bc2466c
Zobrazit plný text záznamu
8
A Topological Treatment of Early-Deciding Set-Agreement
Autor: Rachid Guerraoui, Bastian Pochon, Maurice Herlihy
Publikováno v: Lecture Notes in Computer Science ISBN: 9783540499909
OPODIS
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 con
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b23e91c8bd6a837dc3fbed27adb8a2d0
https://doi.org/10.1007/11945529_3
Zobrazit plný text záznamu
9
Toward a theory of transactional contention managers
Autor: Bastian Pochon, Maurice Herlihy, Rachid Guerraoui
Publikováno v: PODC
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manager algorithms have been proposed and empirically evaluated.In this paper
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbaf6cce846a5bd713426fa4f5301141
https://doi.org/10.1145/1073814.1073863
Zobrazit plný text záznamu
10
From a static impossibility to an adaptive lower bound
Autor: Eli Gafni, Bastian Pochon, Rachid Guerraoui
Publikováno v: STOC
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83e19453ba1aee73ae20b4364509a88d
https://doi.org/10.1145/1060590.1060696
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje