Titlebook: Distributed Computing; 12th International S Shay Kutten Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 ATM.Distributed

考古學(xué)

固定某物

Pantry

https://doi.org/10.1007/978-1-4302-0336-0ilure detector has to maintain in order to detect a transient fault. The history locality is related to the number of consecutive system configurations that a failure detector has to maintain in order to detect a transient fault.

分貝

https://doi.org/10.1007/978-1-4302-0566-1es of simple networks, namely the path, the cycle, the grid, the tori, the complete k-ary tree, and the general tree, we present optimal or near optimal lower and upper bounds on the virtual diameter as a function of the capacity.

新手

Calculus

AUGER

Computing in totally anonymous asynchronous shared memory systems,puted with two registers, the consensus protocol uses a linear number of shared registers and rounds..The paper proves logarithmic lower bounds on the number of registers and rounds needed for solving consensus in this model, indicating the difficulty of computing relations in this model.

使顯得不重要

avenge

忍耐

A stabilizing repair timer,self subject to faults. The main results are requirement specifications for a distributed repair timer and a repair timer algorithm. The algorithm self-stabilizes in . rounds, where . is the diameter of the network, and provides reliable timing from .-faulty configurations within . rounds.