417 search results - page 20 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
ICDCN
2009
Springer
14 years 2 months ago
2009
Springer
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
ISPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
IFIP
2003
Springer
14 years 24 days ago
2003
Springer
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
VECPAR
2004
Springer
14 years 28 days ago
2004
Springer
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...