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

sperse

An improved multiple identification algorithm for synchronous broadcasting networks,oblem, 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

发生

Glycogen

Load balancing in a network of transputers,with other network members via its four high speed serial links. Communication and user application are programmed in OCCAM, a language designed to describe a system of concurrent processes. We present a method to solve combinatorial problems in parallel on a transputer network, i.e. we formulate a

鸵鸟

虚度

Synapse

How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual excmessages and do not share memory. This algorithm does not require a logical clock, and supposes that nodes do not fail..The average number of messages required is in the order of Log(n), where n is the number of nodes..In this paper, the tools are presented for detecting the node failures, and the r

疏忽

嘲弄

Offstage

侵害