[图书][B] Fault-tolerant message-passing distributed systems: an algorithmic approach
M Raynal - 2018 - books.google.com
This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …
and their associated distributed algorithms, in particular in terms of reliable communication …
[图书][B] Distributed computing through combinatorial topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …
distributed algorithms based on award winning combinatorial topology research. The …
The renaming problem in shared memory systems: An introduction
Exploring the power of shared memory communication objects and models, and the limits of
distributed computability are among the most exciting research areas of distributed …
distributed computability are among the most exciting research areas of distributed …
[图书][B] Mathematics and computation: A theory revolutionizing technology and science
A Wigderson - 2019 - books.google.com
From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …
complexity theory, its connections and interactions with mathematics, and its central role in …
The failure detector abstraction
A failure detector is a fundamental abstraction in distributed computing. This article surveys
this abstraction through two dimensions. First we study failure detectors as building blocks to …
this abstraction through two dimensions. First we study failure detectors as building blocks to …
Hundreds of impossibility results for distributed computing
F Fich, E Ruppert - Distributed computing, 2003 - Springer
We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …
outright or within given resource bounds, in various models. The parameters of the models …
Unifying concurrent objects and distributed tasks: Interval-linearizability
Tasks and objects are two predominant ways of specifying distributed problems where
processes should compute outputs based on their inputs. Roughly speaking, a task …
processes should compute outputs based on their inputs. Roughly speaking, a task …
A simplicial complex model for dynamic epistemic logic to study distributed task computability
É Goubault, J Ledent, S Rajsbaum - Information and Computation, 2021 - Elsevier
The usual S 5 n epistemic model for a multi-agent system is based on a Kripke frame, which
is a graph whose edges are labeled with agents that do not distinguish between two states …
is a graph whose edges are labeled with agents that do not distinguish between two states …
Tight bounds for k-set agreement
We prove tight bounds on the time needed to solve k-set agreement. In this problem, each
processor starts with an arbitrary input value taken from a fixed set, and halts after choosing …
processor starts with an arbitrary input value taken from a fixed set, and halts after choosing …