scientific article - MaRDI portal

Michel Raynal, Sergio Rajsbaum, Maurice P. Herlihy

Publication date: 6 August 2020

Full work available at URL: https://miscelaneamatematica.org/welcome/default/download/tbl_articulos.pdf2.932442bf45e242c3.353630362e706466.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The renaming problem in shared memory systems: an introduction
Help when needed, but no more: efficient read/write partial snapshot
Classifying rendezvous tasks of arbitrary dimension
On interprocess communication. I: Basic formalism
More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
A classification of wait-free loop agreement tasks
The Heard-Of model: computing in distributed systems with benign faults
The \(k\)-simultaneous consensus problem
A Layered Analysis of Consensus
Unifying synchronous and asynchronous message-passing models
Locality and Checkability in Wait-Free Computing
The Combinatorial Structure of Wait-Free Solvable Tasks
The topological structure of asynchronous computability
Renaming in an asynchronous environment
A combinatorial characterization of the distributed 1-solvable tasks
The Iterated Restricted Immediate Snapshot Model
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
Reaching approximate agreement in the presence of faults
Impossibility of distributed consensus with one faulty process
The Byzantine Generals Problem
Three-Processor Tasks Are Undecidable
Atomic snapshots of shared memory
Atomic Snapshots in O (n log n) Operations
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
The BG distributed simulation algorithm
Generalized FLP impossibility result for t-resilient asynchronous computations
Immediate atomic snapshots and fast renaming
Combinatorial algebraic topology

This page was built for publication: