Titlebook: Distributed Computing; 18th International C Rachid Guerraoui Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2004 Routing.SPI

规范要多

扩大

Virtual Mobile Nodes for Mobile , Networks, define the ., which consists of robust virtual nodes that are both predictable and reliable. We present the ., a new algorithm that implements the Virtual Mobile Node Abstraction. This algorithm replicates each virtual node at a constantly changing set of real nodes, modifying the set of replicas a

有恶意

Contention-Free MAC Protocols for Wireless Sensor Networks,e . and . (avoid collisions); it should . to changes in the network (such as arrival of new nodes), and these changes should be ., i.e., affect only the nodes in the vicinity of the change; it should not assume that nodes have a global time reference, i.e., nodes may not be time-synchronized. We giv

Congregate

Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems,re interested specifically in the relative powers of systems with different communication mechanisms: anonymous broadcast, read-write registers, or registers supplemented with additional shared-memory objects. We show that a system with anonymous broadcast can simulate a system of shared-memory obje

前面

Synchronous Condition-Based Consensus Adapting to Input-Vector Legality,lts respectively, and . is the legality level of input vectors. Moreover, the algorithm terminates in 1 round if . ≥ . and .=0, and terminates within 2 rounds if . ≥ . holds. Compared with previous algorithms, for the case of . < ./2, the algorithm achieves the best time complexity in almost all situations.

Obverse

On Quorum Systems for Group Resources with Bounded Capacity,stems for mutual exclusion to the problem. We show that the study of quorum systems for (.,1,.)-resource allocation is closely related to some classical problems in combinatorics and in finite projective geometries. By applying the results there, we are able to obtain some optimal/near-optimal quorum systems.

gerontocracy

Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS,e space overhead per variable to a small constant, and not requiring advance knowledge of the maximum number of participating threads, while maintaining minimal amortized expected time and work complexities.

有斑点

Efficient Adaptive Collect Using Randomization,r presents new randomized collect algorithms with asymptotically optimal O(.) step complexity and polynomial memory overhead only. In addition we present a new deterministic collect algorithm which beats the best step complexity for previous polynomial-memory algorithms.

轻浮思想

Systemic