Titlebook: Distributed Algorithms; 8th International Wo Gerard Tel,Paul Vitányi Conference proceedings 1994 Springer-Verlag Berlin Heidelberg 1994 Dis

挡泥板

刺耳

Fast, long-lived renaming,. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more general version of the renaming problem called long-lived renaming. In long-lived renaming algorithms, processes may repeatedly acquire and release names.

Heart-Attack

连系

Finding the extrema of a distributed multiset,t, in synchronous rings of known size, this problem can always be solved in .+ log .) · n) bits and ..) time for any integer c> 0, where .=Max{¦x.¦, ¦x.¦}. The previous solutions required ..) bits and the same amount of time..Based on these results, we also present a bit optimal solution to the problem of finding the multiplicity of the extrema.

Patrimony

0302-9743 ion, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.978-3-540-58449-0978-3-540-48799-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

Hla461

我不怕牺牲

严重伤害

meretricious

Roberta Congestri,Patrizia Albertanot .. can not implement ... (We allow the specifications of the shared objects to be non deterministic.) This result implies not only that the current definition of the wait-free hierarchy does not express the computational power of shared objects, but also that there is no other hierarchy that does.

有助于