Sciweavers

276 search results - page 49 / 56
» Balanced Allocations of Cake
Sort
View
DPD
2006
141views more  DPD 2006»
13 years 7 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
IPPS
2009
IEEE
14 years 2 months ago
Using a market economy to provision compute resources across planet-wide clusters
—We present a practical, market-based solution to the resource provisioning problem in a set of heterogeneous resource clusters. We focus on provisioning rather than immediate sc...
Murray Stokely, Jim Winget, E. Keyes, C. Grimes, B...
IPPS
2009
IEEE
14 years 2 months ago
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between ...
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgol...
QEST
2007
IEEE
14 years 1 months ago
A business-oriented load dispatching framework for online auction sites
Online auction sites have unique workloads and user behavior characteristics that do not exist in other e-commerce sites. Earlier studies by the authors identified i) significan...
Daniel A. Menascé, Vasudeva Akula