1257 search results - page 82 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
188
click to vote
DCOSS
2011
Springer
14 years 1 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
148
click to vote
INFOCOM
2010
IEEE
15 years 2 days ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
119
Voted
DCOSS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
120
click to vote
CLUSTER
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
119
click to vote
COOPIS
1997
IEEE
15 years 5 months ago
1997
IEEE
Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments which a...