On implementing SWMR registers from SWSR registers in systems with Byzantine failures

Συγγραφείς: Hu, Xing, Toueg, Sam^{Aff1, IDs00446024004655_cor2}

Πηγή: Distributed Computing. :1-31

Complexity of Boolean automata networks under block-parallel update modes

Συγγραφείς: Perrot, Kévin, Sené, Sylvain, Tapin, Léah

Συνεισφορές: Kévin Perrot and Sylvain Sené and Léah Tapin, Sené, Sylvain

Θεματικοί όροι: reductions and completeness, finite dynamical systems, Computer Science - Computational Complexity, Theory of computation → Distributed computing models, Theory of computation → Problems, [INFO] Computer Science [cs], ddc:004, block-parallel update schedule, Boolean networks, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.06294
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.19

Distributed derandomization revisited

Συγγραφείς: Dahal, Sameep, d'Amore, Francesco, Lievonen, Henrik, Picavet, Timothé, Suomela, Jukka

Συνεισφορές: d'Amore, Francesco

Θεματικοί όροι: Locally checkable labelings, FOS: Computer and information sciences, Theory of computation → Pseudorandomness and derandomization, Distributed algorithm, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Distributed computing models, Local model, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], LOCAL model, Derandomization, Distributed, Parallel, and Cluster Computing (cs.DC), Distributed Algorithms

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2305.07351
https://hal.science/hal-04095896v2
https://hal.science/hal-04095896v2/document
https://doi.org/10.4230/lipics.disc.2023.40

Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems

Συγγραφείς: Déprés, Mathilde, Mostéfaoui, Achour, Perrin, Matthieu, Raynal, Michel

Συνεισφορές: Taïani, François, Mathilde Déprés and Achour Mostéfaoui and Matthieu Perrin and Michel Raynal

Θεματικοί όροι: Consensus, Asynchrony, Computer systems organization → Fault-tolerant network topologies, Characterization, Test&, Lattice agreement, [INFO] Computer Science [cs], Test&Set, Message-passing, Read/Write register, Distributed Computability, Broadcast abstraction, Networks → Programming interfaces, Computability, Two-process communication, Message pattern, Distributed software engineering, Crash failure, Simplicity, Mutual exclusion, Theory of computation → Distributed computing models, ddc:004, Atomicity, Quorum, Read/write pattern, Set, amp

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.16

Behavioural Types for Local-First Software (Artifact)

Συγγραφείς: Kuhn, Roland, Melgratti, Hernán, Tuosto, Emilio

Συνεισφορές: Roland Kuhn and Hernán Melgratti and Emilio Tuosto, de León, Hernán Ponce, Winter, Stefan

Πηγή: 37th European Conference on Object-Oriented Programming (ECOOP 2023)

Θεματικοί όροι: local-first software, Software and its engineering → Distributed programming languages, Software and its engineering → Distributed systems organizing principles, publish-subscribe, Theory of computation → Distributed computing models, Distributed coordination, behavioural types, ddc:004, asynchronous communication

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.14

Decentralised Runtime Verification of Timed Regular Expressions

Συγγραφείς: Roussanaly, Victor, Falcone, Yliès

Συνεισφορές: Compiler Optimization and Run-time Systems (CORSE), Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)

Πηγή: TIME 2022 - 29th International Symposium on Temporal Representation and Reasoning ; https://inria.hal.science/hal-03911668 ; TIME 2022 - 29th International Symposium on Temporal Representation and Reasoning, Nov 2022, Online, France. pp.1-18, ⟨10.4230/LIPIcs.12⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Distributed computing models Theory of computation → Regular languages Theory of computation → Rewrite systems Theory of computation → Automata over infinite objects Computer systems organization → Real-time system specification phrases Timed expressions, Timed properties, Monitoring, Runtime verification, Decentralized systems, Asynchronous communication Digital Object Identifier 10.4230/LIPIcs.12, 2012 ACM Subject Classification Theory of computation → Distributed computing models, Theory of computation → Regular languages, Theory of computation → Rewrite systems, Theory of computation → Automata over infinite objects, Computer systems organization → Real-time system specification phrases Timed expressions, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]

Θέμα γεωγραφικό: Online, France

Διαθεσιμότητα: https://inria.hal.science/hal-03911668
https://inria.hal.science/hal-03911668v1/document
https://inria.hal.science/hal-03911668v1/file/time22.pdf
https://doi.org/10.4230/LIPIcs.12

Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations

Συγγραφείς: Attiya, Hagit, Enea, Constantin, Welch, Jennifer, L

Συνεισφορές: Technion - Israel Institute of Technology Haifa, École polytechnique (X), Institut Polytechnique de Paris (IP Paris), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Texas A&M University Galveston

Πηγή: PODC '22: ACM Symposium on Principles of Distributed Computing ; https://hal.science/hal-04465383 ; PODC '22: ACM Symposium on Principles of Distributed Computing, Jul 2022, Salerno Italy, Italy. pp.209-219, ⟨10.1145/3519270.3538446⟩

Θεματικοί όροι: • Theory of computation → Distributed computing models Concurrent algorithms Distributed algorithms • Computing methodologies → Distributed algorithms Concurrent algorithms Concurrent Objects Strong Linearizability Randomized Programs ABD Simulation Atomic Snapshots Shared registers, • Theory of computation → Distributed computing models, Concurrent algorithms, Distributed algorithms, • Computing methodologies → Distributed algorithms, Concurrent algorithms Concurrent Objects, Strong Linearizability, Randomized Programs, ABD Simulation, Atomic Snapshots, Shared registers, [INFO]Computer Science [cs]

Θέμα γεωγραφικό: Salerno Italy, Italy

Διαθεσιμότητα: https://hal.science/hal-04465383
https://hal.science/hal-04465383v1/document
https://hal.science/hal-04465383v1/file/podc22.pdf
https://doi.org/10.1145/3519270.3538446

Designing Asynchronous Multiparty Protocols with Crash-Stop Failures (Artifact)

Συγγραφείς: Barwell, Adam D., Hou, Ping, Yoshida, Nobuko, Zhou, Fangyi

Συνεισφορές: Adam D. Barwell and Ping Hou and Nobuko Yoshida and Fangyi Zhou

Θεματικοί όροι: Failure Handling, Scala, Theory of computation → Process calculi, Theory of computation → Distributed computing models, Concurrency, Session Types, ddc:004, Software and its engineering → Source code generation, Software and its engineering → Concurrent programming languages, Code Generation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.9

Fast and succinct population protocols for Presburger arithmetic

Συγγραφείς: Czerner, Philipp, Guttenberg, Roland, Helfrich, Martin, Esparza, Javier

Συνεισφορές: Philipp Czerner and Roland Guttenberg and Martin Helfrich and Javier Esparza, Aspnes, James, Michail, Othon

Πηγή: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
Journal of Computer and System Sciences

Θεματικοί όροι: 0106 biological sciences, FOS: Computer and information sciences, fast, succinct, population computers, 0102 computer and information sciences, 01 natural sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Distributed computing models, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, population protocols, F.1.1

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2202.11601
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.11

Complexity of Coverability in Depth-Bounded Processes

Συγγραφείς: Balasubramanian, A. R.

Συνεισφορές: A. R. Balasubramanian, Klin, Bartek, Lasota, Sławomir, Muscholl, Anca

Πηγή: 33rd International Conference on Concurrency Theory, CONCUR 2022

Θεματικοί όροι: π-calculus, Depth-bounded processes, Theory of computation → Distributed computing models, Theory of computation → Problems, reductions and completeness, ddc:004, Fast-growing complexity classes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.17

Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers

Συγγραφείς: Attiya, Hagit, Enea, Constantin, Welch, Jennifer L.

Συνεισφορές: Hagit Attiya and Constantin Enea and Jennifer L. Welch, Gilbert, Seth

Θεματικοί όροι: FOS: Computer and information sciences, Impossibility proofs, Computing methodologies → Concurrent algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, Concurrent Objects, Computer Science - Distributed, Parallel, and Cluster Computing, Computing methodologies → Distributed algorithms, Shared registers, Theory of computation → Distributed computing models, Theory of computation → Concurrent algorithms, Message-passing systems, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004, Strong linearizability, BG simulation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2105.06614
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.7

Complexity of Coverability in Bounded Path Broadcast Networks

Συγγραφείς: Balasubramanian, A. R.

Συνεισφορές: A. R. Balasubramanian, Bojańczyk, Mikołaj, Chekuri, Chandra

Πηγή: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021

Θεματικοί όροι: Bounded path networks, Theory of computation → Distributed computing models, Parameterized verification, Theory of computation → Problems, reductions and completeness, ddc:004, Fast-growing complexity classes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.35

Send/Receive Patterns versus Read/Write Patterns: the MB-Broadcast Abstraction (Extended Version)

Συγγραφείς: Déprés, Mathilde, Mostefaoui, Achour, Perrin, Matthieu, Raynal, Michel

Συνεισφορές: Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Gestion de Données Distribuées (LS2N - équipe GDD), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-NANTES UNIVERSITÉ - École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), the World Is Distributed Exploring the tension between scale and coordination (WIDE), Centre Inria de l'Université de Rennes, 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)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-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)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), Projet "Étoile montante en Pays de la Loire" BROCCOLI, ANR-20-CE25-0002,ByBloS,Au-delà des Blockchains : Modules de construction pour les applications à grande échelle zero-confiance multi-utilisateurs(2020)

Πηγή: https://hal.science/hal-04087447 ; 2023.

Θεματικοί όροι: Mutual exclusion, Two-process communication, Simplicity, Test&Set, Read/Write register, Read/write pattern, Quorum, Message pattern, Message-passing, Lattice agreement, Distributed software engineering, Crash failure, Consensus, Characterization, Broadcast abstraction, Atomicity, Asynchrony, CCS Concepts: • Theory of computation → Distributed computing models, • Computer systems organiza-tion → Fault-tolerant network topologies, • Networks → Programming interfaces, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Διαθεσιμότητα: https://hal.science/hal-04087447
https://hal.science/hal-04087447v1/document
https://hal.science/hal-04087447v1/file/MBroadcast_extended.pdf

Introduction to the Special Issue on Distributed Hybrid Systems

Συγγραφείς: Abate, Alessandro, Fahrenberg, Uli, Fränzle, Martin

Πηγή: Leibniz Transactions on Embedded Systems; Vol. 8 No. 2 (2022): Special Issue on Distributed Hybrid Systems; 00:1-00:3 ; 2199-2002 ; 10.4230/LITES-v008-i002

Θεματικοί όροι: Distributed hybrid systems, Computing methodologies~Model verification and validation, Computer systems organization~Embedded and cyber-physical systems, Mathematics of computing~Stochastic processes, Theory of computation~Concurrency, Theory of computation~Distributed computing models, Theory of computation~Logic and verification, Theory of computation~Program reasoning, Theory of computation~Self-organization, Theory of computation~Timed and hybrid models

Περιγραφή αρχείου: application/pdf

Relation: https://ojs.dagstuhl.de/index.php/lites/article/view/lites-v008-i002-a000/48

Διαθεσιμότητα: https://ojs.dagstuhl.de/index.php/lites/article/view/lites-v008-i002-a000
https://doi.org/10.4230/LITES.8.2.0

Characterizing consensus in the Heard-Of model

Συγγραφείς: Balasubramanian, A. R., Walukiewicz, Igor

Συνεισφορές: A. R. Balasubramanian and Igor Walukiewicz, Walukiewicz, Igor, Igor Konnov, Laura Kovács

Πηγή: 31st International Conference on Concurrency Theory, CONCUR 2020

Θεματικοί όροι: FOS: Computer and information sciences, consensus problem, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Heard-Of model, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Theory of computation → Logic and verification, 01 natural sciences, Logic in Computer Science (cs.LO), Theory of computation → Distributed computing models, Software and its engineering → Software verification, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, verification

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2004.09621
https://drops.dagstuhl.de/opus/volltexte/2020/12821/
https://doi.org/10.4230/LIPIcs.CONCUR.2020.9
https://drops.dagstuhl.de/opus/volltexte/2020/12821/pdf/LIPIcs-CONCUR-2020-9.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-09621
https://arxiv.org/abs/2004.09621
http://doi.org/10.4230/LIPIcs.CONCUR.2020.9
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.9
https://hal.science/hal-03023767v1
https://doi.org/10.4230/lipics.concur.2020.9
https://hal.science/hal-03023767v1/document

Flatness and Complexity of Immediate Observation Petri Nets

Συγγραφείς: Raskin, Mikhail, Weil-Kennedy, Chana, Esparza, Javier

Συνεισφορές: Mikhail Raskin and Chana Weil-Kennedy and Javier Esparza, Igor Konnov, Laura Kovács

Πηγή: 31st International Conference on Concurrency Theory, CONCUR 2020

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theory of computation → Concurrency, Flattability, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), Parameterized Verification, Reachability Analysis, Theory of computation → Distributed computing models, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Petri Nets

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2001.09966
https://drops.dagstuhl.de/opus/volltexte/2020/12857/pdf/LIPIcs-CONCUR-2020-45.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12857/
https://dblp.uni-trier.de/db/conf/concur/concur2020.html#RaskinWE20
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.45

leaderless state machine replication specification properties limits

Συγγραφείς: França Rezende, Tuanir, Sutra, Pierre

Συνεισφορές: Tuanir França Rezende and Pierre Sutra, Attiya, Hagit

Θεματικοί όροι: General and reference → Performance, Consensus, Software and its engineering → Distributed systems organizing principles, Theory of computation → Distributed computing models, Fault Tolerance, ddc:004, State Machine Replication

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2020/13102/
https://dblp.uni-trier.de/db/conf/wdag/disc2020.html#RezendeS20
https://drops.dagstuhl.de/opus/volltexte/2020/13102/pdf/LIPIcs-DISC-2020-24.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.24

A Classification of Weak Asynchronous Models of Distributed Computing

Συγγραφείς: Esparza, Javier, Reiter, Fabian

Συνεισφορές: Javier Esparza and Fabian Reiter, Reiter, Fabian, Igor Konnov, Laura Kovács

Πηγή: 31st International Conference on Concurrency Theory, CONCUR 2020

Θεματικοί όροι: FOS: Computer and information sciences, Concurrency theory, Asynchrony, 9. Industry and infrastructure, Formal Languages and Automata Theory (cs.FL), 4. Education, Weak models of distributed computing, Theory of computation → Concurrency, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, 3. Good health, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Distributed computing models, 11. Sustainability, Theory of computation → Automata extensions, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, 10. No inequality, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2007.03291
https://drops.dagstuhl.de/opus/volltexte/2020/12822/pdf/LIPIcs-CONCUR-2020-10.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12822/
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-03291
https://doi.org/10.4230/LIPIcs.CONCUR.2020.10
https://arxiv.org/abs/2007.03291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.10
https://hal.science/hal-03678065v1/document
https://doi.org/10.4230/lipics.concur.2020.10
https://hal.science/hal-03678065v1

Classification of distributed binary labeling problems

Συγγραφείς: Sebastian, Brandt, Efron, Yuval, Hirvonen, Juho, Maus, Yannic, Olivetti, Dennis, Suomela, Jukka, Balliu, Alkida

Συνεισφορές: Alkida Balliu and Sebastian Brandt and Yuval Efron and Juho Hirvonen and Yannic Maus and Dennis Olivetti and Jukka Suomela, Attiya, Hagit, Department of Computer Science, Professorship Suomela J., Computer Science - Algorithms and Theoretical Computer Science (TCS) - Research area, Swiss Federal Institute of Technology Zurich, Technion - Israel Institute of Technology, Albert-Ludwigs-Universität Freiburg, Aalto-yliopisto, Aalto University

Πηγή: Leibniz International Proceedings in Informatics (LIPIcs), 179
34th International Symposium on Distributed Computing (DISC 2020)
34th International Symposium on Distributed Computing

Θεματικοί όροι: ta113, FOS: Computer and information sciences, LOCAL model, graph problems, locally checkable labeling problems, distributed computational complexity, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Distributed computing models, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Theory of computation → Complexity classes

Περιγραφή αρχείου: application/pdf; application/application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1911.13294
http://juuli.fi/Record/0371446220
https://doi.org/10.4230/LIPIcs.DISC.2020.17
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-13294
https://drops.dagstuhl.de/opus/volltexte/2020/13095/pdf/LIPIcs-DISC-2020-17.pdf/
https://doi.org/10.4230/LIPIcs.DISC.2020.17
https://www.research-collection.ethz.ch/handle/20.500.11850/466923
https://drops.dagstuhl.de/opus/volltexte/2020/13095/
https://www.arxiv-vanity.com/papers/1911.13294/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.17
http://hdl.handle.net/20.500.11850/466923
https://aaltodoc.aalto.fi/handle/123456789/101541

The weakest failure detector for genuine atomic multicast

Συγγραφείς: Sutra, Pierre

Συνεισφορές: Institut Polytechnique de Paris (IP Paris), Département Informatique (TSP - INF), Institut Mines-Télécom Paris (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris), Efficient and safe distributed systems (Benagil-Samovar), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Institut Mines-Télécom Paris (IMT)-Télécom SudParis (TSP)

Πηγή: DISC 2022 : 36th International Symposium on Distributed Computing ; 36th International Symposium on Distributed Computing (DISC '22) ; https://hal.science/hal-04251904 ; 36th International Symposium on Distributed Computing (DISC '22), Oct 2022, Augusta, GA, United States. ⟨10.4230/LIPIcs.DISC.2022.35⟩

Θεματικοί όροι: Failure Detector, State Machine Replication, Consensus, Theory of computation → Distributed computing models, Software and its engineering → Distributed systems organizing principles, General and reference → Reliability, [INFO]Computer Science [cs]

Θέμα γεωγραφικό: Augusta, GA, United States

Διαθεσιμότητα: https://hal.science/hal-04251904
https://doi.org/10.4230/LIPIcs.DISC.2022.35