Sciweavers

258 search results - page 1 / 52
» Connectivity in Eventually Quiescent Dynamic Distributed Sys...
Sort
View
LADC
2007
Springer
13 years 11 months ago
Connectivity in Eventually Quiescent Dynamic Distributed Systems
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
Sara Tucci Piergiovanni, Roberto Baldoni
WDAG
1997
Springer
92views Algorithms» more  WDAG 1997»
13 years 9 months ago
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
IPPS
2010
IEEE
13 years 2 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
SIROCCO
2000
13 years 6 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
13 years 9 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman