t-Resilient Immediate Snapshot Is Impossible

DOI10.1007/978-3-319-48314-6_12zbMath1482.68055OpenAlexW2473684670MaRDI QIDQ2835025

Sergio Rajsbaum, Hugues Fauconnier, Carole Delporte, Michel Raynal

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_12

zbMATH Keywords

linearizabilityconsensusasynchronous systemwait-freedom\(k\)-set agreementdistributed computabilityiterated modelprocess crash failureimpossibilityimmediate snapshotatomic read/write register\(t\)-resiliencesnapshot object

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (2)

Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ t-Resilient Immediate Snapshot Is Impossible

Cites Work

• Unnamed Item
• Unnamed Item
• Power and limits of distributed computing shared memory models
• An impossibility about failure detectors in the iterated immediate snapshot model
• On interprocess communication. I: Basic formalism
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
• A simple constructive computability theorem for wait-free computation
• t-Resilient Immediate Snapshot Is Impossible
• A generalized asynchronous computability theorem
• The topological structure of asynchronous computability
• Concurrent Programming: Algorithms, Principles, and Foundations
• Renaming in an asynchronous environment
• The Iterated Restricted Immediate Snapshot Model
• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming

This page was built for publication: t-Resilient Immediate Snapshot Is Impossible