511 search results - page 70 / 103 » Lower bounds for distributed markov chain problems |
119
click to vote
PODC
1999
ACM
15 years 6 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
136
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
107
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
109
click to vote
CJ
2010
14 years 11 months ago
2010
Consistent with the divide-and-conquer approach to problem solving, a recursive result is presented in the domain of stochastic modelling that derives product-form solutions for t...
135
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...