Sciweavers

4642 search results - page 282 / 929
» Distributed algorithm and reversible network
Sort
View
IPPS
2007
IEEE
16 years 29 days ago
An optimistic checkpointing and selective message logging approach for consistent global checkpoint collection in distributed sy
In this paper, we present an asynchronous consistent global checkpoint collection algorithm which prevents contention for network storage at the file server and hence reduces the...
Qiangfeng Jiang, D. Manivannan
GLOBECOM
2006
IEEE
16 years 21 days ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
ALGOSENSORS
2006
Springer
15 years 8 months ago
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least onc...
Volker Turau
ICDCS
2007
IEEE
16 years 29 days ago
A High Throughput Atomic Storage Algorithm
This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations...
Rachid Guerraoui, Dejan Kostic, Ron R. Levy, Vivie...
ICDCS
2006
IEEE
16 years 21 days ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer