Titlebook: Distributed Computing; 22nd International S Gadi Taubenfeld Conference proceedings 2008 The Editor(s) (if applicable) and The Author(s), un

猜忌

障礙

Gareth P. Dyas,Heinz T. Thanheiserer of RMRs a process makes per passage in our algorithm is .( min (.,log.)), where . is the point contention. Our algorithm matches known RMR complexity lower bounds for the class of ME algorithms that use reads and writes only, and beats the RMR complexity of prior algorithms in this class that have the FCFS property.

Psa617

Oliver Baumann,Jason B. Mattingleythe diameter of the network. Specifically, for a family of bounded-degree graphs with logarithmic diameter, .(log.) time and .(. log.) messages. Furthermore, our proposed solution requires constant memory space at each node.