2924 search results - page 105 / 585 » Lower Bounds in Distributed Computing |
138
click to vote
CLUSTER
2001
IEEE
15 years 6 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
134
click to vote
ECRTS
2010
IEEE
15 years 2 months ago
2010
IEEE
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
118
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
101
Voted
ENTCS
2006
15 years 2 months ago
2006
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
114
Voted
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...