Programming at the edge of synchrony
| Autor: | Josef Widder, Cezara Drăgoi, Damien Zufferey |
|---|---|
| Přispěvatelé: | Analyse Statique par Interprétation Abstraite (ANTIQUE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Vienna University of Technology (TU Wien), Max Planck Institute for Software Systems (MPI-SWS), Damien Zufferey is supported in part by the Deutsche Forschungsgemeinschaft project 389792660-TRR 248 and by the European Research Council under the Grant Agreement 610150 (http://www.impact-erc.eu/) (ERC Synergy Grant ImPACT). Most of the work was done while Cezara Drăgoi was at INRIA, France, supported by the French National Research Agency ANR project SAFTA (12744-ANR-17-CE25-0008-01). Cezara Drăgoi and Josef Widder are supported by Interchain Foundation., ANR-17-CE25-0008,SAFTA,Analyse statique des algorithmes distribués tolérants aux pannes(2017), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria de Paris |
| Rok vydání: | 2020 |
| Předmět: |
Theoretical computer science
Computer science 020206 networking & telecommunications Fault tolerance 02 engineering and technology Distributed systems Fault-tolerance Synchrony Asynchronous communication Synchronization (computer science) Communication in small groups 0202 electrical engineering electronic engineering information engineering [INFO]Computer Science [cs] 020201 artificial intelligence & image processing Enhanced Data Rates for GSM Evolution Round Model Safety Risk Reliability and Quality Implementation Protocol (object-oriented programming) Software Abstraction (linguistics) |
| Zdroj: | SPLASH 2020-ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity SPLASH 2020-ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity, Oct 2020, Chicago / Virtual, United States. ⟨10.1145/3428281⟩ Proceedings of the ACM on Programming Languages |
| ISSN: | 2475-1421 |
| DOI: | 10.1145/3428281 |
| Popis: | Synchronization primitives for fault-tolerant distributed systems that ensure an effective and efficient cooperation among processes are an important challenge in the programming languages community. We present a new programming abstraction, ReSync, for implementing benign and Byzantine fault-tolerant protocols. ReSync has a new round structure that offers a simple abstraction for group communication, like it is customary in synchronous systems, but also allows messages to be received one by one, like in the asynchronous systems. This extension allows implementing network and algorithm-specific policies for the message reception, which is not possible in classic round models. The execution of ReSync programs is based on a new generic round switch protocol that generalizes the famous theoretical result about consensus in the presence of partial synchrony by of Dwork, Lynch, and Stockmeyer. We evaluate experimentally the performance of ReSync’s execution platform, by comparing consensus implementations in ReSync with LibPaxos3, etcd, and Bft-SMaRt, three consensus libraries tolerant to benign, resp. byzantine faults. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|