Sciweavers

1325 search results - page 159 / 265
» Quasirandom Load Balancing
Sort
View
ADHOC
2008
59views more  ADHOC 2008»
15 years 4 months ago
Sacrificing a little coverage can substantially increase network lifetime
We present a simple, local protocol, pCover, which provides partial (but high) coverage in sensor networks. Through pCover, we demonstrate that it is feasible to maintain a high c...
Limin Wang, Sandeep S. Kulkarni
CCR
2008
99views more  CCR 2008»
15 years 4 months ago
The resource pooling principle
Since the ARPAnet, network designers have built localized mechanisms for statistical multiplexing, load balancing, and failure resilience, often without understanding the broader ...
Damon Wischik, Mark Handley, Marcelo Bagnulo Braun
CONCURRENCY
2008
79views more  CONCURRENCY 2008»
15 years 4 months ago
Job submission to grid computing environments
The problem of enabling scientist users to submit jobs to grid computing environments will eventually limit the usability of grids. The eMinerals project has tackled this problem ...
Richard P. Bruin, Toby O. H. White, Andrew M. Walk...
CONCURRENCY
2008
84views more  CONCURRENCY 2008»
15 years 4 months ago
Dynamic allocation in a self-scaling cluster database
Abstract. Database systems have been vital for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in sm...
Tilmann Rabl, Marc Pfeffer, Harald Kosch
JCM
2006
95views more  JCM 2006»
15 years 4 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang