Sciweavers

373 search results - page 44 / 75
» Local Scheduling for Volunteer Computing
Sort
View
ICDCS
2010
IEEE
13 years 12 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 5 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
FGCS
2008
103views more  FGCS 2008»
13 years 8 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
IWCMC
2006
ACM
14 years 1 months ago
A distributed load-based transmission scheduling protocol for wireless ad hoc networks
This paper presents a load-based transmission scheduling (LoBaTS) protocol for wireless ad hoc networks. Since terminals in these networks may be required to forward unequal amoun...
Brian J. Wolf, Joseph L. Hammond, Harlan B. Russel...
MOBIHOC
2007
ACM
14 years 7 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang