Titlebook: Distributed Algorithms; 6th International Wo Adrian Segall,Shmuel Zaks Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 A

ELUC

Distributed computing on anonymous hypercubes with faulty components,rs and links). The processors are deterministic and execute identical protocols given identical data. Initially, they know only the size of the network (in this instance, a power of 2) and that they are inter-connected in a hypercube network. Faults may occur only before the start of the computation

chassis

spondylosis

https://doi.org/10.1007/978-1-349-03555-7mplementation improves this on all counts by using . coin flips, .(log .) parallel time, . sequential time, per operation, and .(.) space per processor. Thus the question on the difference in the expected complexity of randomized constructions of concurrent objects from read/write registers is raised.

investigate

https://doi.org/10.1007/978-1-349-06516-5ss. For routes of length . or less, using only one direction, scheduling is shown to require .(1) time. For simple routes using only two or three directions, scheduling is shown to require 2. + 3 and 2. + 4 time, respectively. Finally, for arbitrary simple routes scheduling is shown to require 2. + ?(?.) time.

十字架

現(xiàn)代

Wait-free test-and-set,mplementation improves this on all counts by using . coin flips, .(log .) parallel time, . sequential time, per operation, and .(.) space per processor. Thus the question on the difference in the expected complexity of randomized constructions of concurrent objects from read/write registers is raised.

展覽

Traffic-light scheduling on the grid,ss. For routes of length . or less, using only one direction, scheduling is shown to require .(1) time. For simple routes using only two or three directions, scheduling is shown to require 2. + 3 and 2. + 4 time, respectively. Finally, for arbitrary simple routes scheduling is shown to require 2. + ?(?.) time.

frivolous

Distributed computing on anonymous hypercubes with faulty components,ze this number of bits. The main result of this paper is an algorithm for computing boolean functions on anonymous hypercubes with at most . faulty components, .≥1, with bit complexity ....λ. log log .), where . is the number of faulty components, of which λ is the number of faulty links, and ..(γ) is the diameter of the hypercube.

珍奇

Dna262