Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Taubenfeld, Gadi"'
This article unifies and generalizes fundamental results related to $n$-process asynchronous crash-prone distributed computing. More precisely, it proves that for every $0\leq k \leq n$, assuming that process failures occur only before the number of
Externí odkaz:
http://arxiv.org/abs/2309.11350
Autor:
Taubenfeld, Gadi
In an anonymous shared memory system, all inter-process communications are via shared objects; however, unlike in standard systems, there is no a priori agreement between processes on the names of shared objects [14,15]. Furthermore, the algorithms a
Externí odkaz:
http://arxiv.org/abs/2309.11337
Autor:
Taubenfeld, Gadi
In agreement problems, each process has an input value and must choose a decision (output) value. Given $n\geq 2$ processes and $m \geq 2$ possible different input values, we want to design an agreement algorithm that enables as many processes as pos
Externí odkaz:
http://arxiv.org/abs/2205.04873
This article addresses election in fully anonymous systems made up of $n$ asynchronous processes that communicate through atomic read-write registers or atomic read-modify-write registers. Given an integer $d\in\{1,\dots, n-1\}$, two elections proble
Externí odkaz:
http://arxiv.org/abs/2203.02988
A distributed computing system is a collection of processors that communicate either by reading and writing from a shared memory or by sending messages over some communication network. Most prior biologically inspired distributed computing algorithms
Externí odkaz:
http://arxiv.org/abs/2005.06502
Autor:
TAUBENFELD, GADI1 tgadi@idc.ac.il
Publikováno v:
Journal of the ACM. Jul2022, Vol. 69 Issue 4, p1-30. 30p.
Autor:
Raynal, Michel, Taubenfeld, Gadi
Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. This article introduces the fully
Externí odkaz:
http://arxiv.org/abs/1909.05576
Publikováno v:
In Theoretical Computer Science 26 July 2023 966-967