2924 search results - page 154 / 585 » Lower Bounds in Distributed Computing |
214
click to vote
PRDC
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...
189
click to vote
ISPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
203
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
172
click to vote
ICDCS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
191
click to vote
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...