Search

Your search keyword '"t-resilience"' showing total 5 results
Start Over Descriptor "t-resilience" Publisher springer international publishing
5 results on '"t-resilience"'

1. k-Immediate Snapshot and x-Set Agreement: How Are They Related?

Author

Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Devismes, Stéphane, editor, and Mittal, Neeraj, editor

Published
2020
Full Text
View/download PDF

2. Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour

Author

Castañeda, Armando, Moses, Yoram, Raynal, Michel, Roy, Matthieu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, El Abbadi, Amr, editor, and Garbinato, Benoît, editor

Published
2017
Full Text
View/download PDF

3. t-Resilient Immediate Snapshot Is Impossible

Author

Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Suomela, Jukka, editor

Published
2016
Full Text
View/download PDF

4. Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems

Author

Imbs, Damien, Rajsbaum, Sergio, Raynal, Michel, Stainer, Julien, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, and Halldórsson, Magnús M., editor

Published
2014
Full Text
View/download PDF

5. Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems

Author

Julien Stainer, Sergio Rajsbaum, Damien Imbs, Michel Raynal, Instituto de Matematicas [México], Universidad Nacional Autónoma de México = National Autonomous University of Mexico (UNAM), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), ANR-11-BS02-0014,DISPLEXITY,Calculabilité et complexité en distribué(2011), Universidad Nacional Autónoma de México (UNAM), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Byzantine process, Theoretical computer science, Approximate agreement, Reliable broadcast, Single-writer/multi-reader register, Computer science, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, 01 natural sciences, t-Resilience, Broadcast abstraction, 0202 electrical engineering, electronic engineering, information engineering, Byzantine fault tolerance, Reliable shared memory, Abstraction (linguistics), Distributed shared memory, Message passing, 020207 software engineering, Atomic read/write register, Distributed computing, Asynchronous message-passing system, Message-passing system, Quantum Byzantine agreement, Shared memory, 010201 computation theory & mathematics, Distributed algorithm, Distributed memory, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Quorum
Abstract

International audience; This paper is on the construction and the use of a shared memory abstraction on top of an asynchronous message-passing system in which up to t processes may commit Byzantine failures. This abstraction consists of arrays of n single-writer/multi-reader atomic registers, where n is the number of processes. Differently from usual atomic registers which record a single value, each of these atomic registers records the whole history of values written to it. A distributed algorithm building such a shared memory abstraction it first presented. This algorithm assumes t

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results