Book Chapter10.1007/978-3-642-16023-3_30
Recursion in distributed computing
Eli Gafni,Sergio Rajsbaum +1 more
- 20 Sep 2010
- pp 362-376
48
TL;DR: This work presents several distributed algorithms in a recursive form, which makes them easier to understand and analyze and exposes several interesting issues arising in recursive distributed algorithms.
read more
Abstract: The benefits of developing algorithms via recursion are well known. However, little use of recursion has been done in distributed algorithms, in spite of the fact that recursive structuring principles for distributed systems have been advocated since the beginning of the field. We present several distributed algorithms in a recursive form, which makes them easier to understand and analyze. Also, we expose several interesting issues arising in recursive distributed algorithms. Our goal is to promote the use and study of recursion in distributed algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributed programming with tasks
Eli Gafni,Sergio Rajsbaum +1 more
- 14 Dec 2010
TL;DR: A new simulation from the snapshots model to the IS model is presented, and it is shown that the simulation can work with models that have access to certain communication objects, called 01-tasks, and that it can be extended to work with Models stronger that wait-free.
62
Power and limits of distributed computing shared memory models
TL;DR: The fundamental role that topology plays in the distributed computability theory is explained, and a powerful simulation technique is presented that allows to show that, from a computability point of view, t-resilience is not different from wait-freedom.
44
The Iterated Restricted Immediate Snapshot Model
Sergio Rajsbaum,Michel Raynal,Corentin Travers +2 more
- 27 Jun 2008
TL;DR: The paper shows that an elegant way of capturing the power of a failure detector and other partially synchronous systems in the ${\mathit{IIS}}$ model is by restricting appropriately its set of runs, giving rise to the Iterated Restricted Immediate Snapshot model.
Monochromatic cycles and monochromatic paths in arc-colored digraphs
TL;DR: If C(D) does not contain neither rainbow triangles nor rainbow P3 involving colors of both C1 and C2, then D has a kernel by monochromatic paths, a wide extension of the original result by Sands, Sauer and Woodrow.
On the asymptotic behaviour of increasing self-similar Markov processes
Mexico
- 19 Apr 2009
TL;DR: In this paper, it has been shown that a self-similar Markov process converges in law to a non-degenerate random variable if and only if the associated subordinator has Laplace exponent that varies regularly at 0.
22
References
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
4.7K
Impossibility of distributed consensus with one faulty process
Michael J. Fischer,Nancy Lynch,Mike Paterson +2 more
- 21 Mar 1983
TL;DR: It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.
3.7K
Wait-free synchronization
TL;DR: A hierarchy of objects is derived such that no object at one level has a wait-free implementation in terms of objects at lower levels, and it is shown that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy.