Titlebook: Distributed Algorithms; 2nd International Wo J. Leeuwen Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 algorithm.algori

ascetic

In-Situ

掃興

https://doi.org/10.1007/978-1-349-17125-5location of a remote resource. In this paper, we propose a query mechanism based on flooding with feedback which uses no more than two messages over any link. We examine the fault tolerant aspects of this distributed query mechanism, operating in a network with potentially faulty links and nodes and

MITE

The Dictionary of Modern Economicsen the computation is finished two cases may occur according to the application. The result is either known by each node or distributed on each node. Furthermore during the computation all the nodes have the same behaviour (there is no privileged node). We shall call the distributed algorithms which

GOAT

https://doi.org/10.1007/978-1-349-17125-5the early-stopping property. Moreover, minor changes in the fault model resulted in drastically different protocols. In this paper, we expose a fundamental technique that underlies most of these protocols. We then derive a simple, intuitive, failure-model-independent scheme for solving the Byzantine

AXIS

The Dictionary of Modern Economicsber of processors are allowed to have ., that is, fail arbitrarily. They effectively run a byzantine agreement algorithm for each process in the network. Here we show that only one byzantine agreement algorithm is necessary, if we treat the outside signal source as an additional potentially faulty p

陰郁

https://doi.org/10.1007/978-1-349-17125-5oblem, where each of the p processors has a bit-string of length n and wants to determine the subset of processors that have the same string as itself. They described an O(n log.p + p) algorithm where the processors do not use any algebraic operations. In this paper an improved version is given with

水槽

The Dictionary of Modern Economics. Tree pattern matching is a fundamental operation in many programming task such as code optimization and automated theorem proving, and has a number of applications in distributed systems. We present both a top-down and bottom-up algorithm for linear tree pattern matching (where any variable occurs

Preserve