3098 search results - page 158 / 620 » On distributed smooth scheduling |
202
click to vote
GCC
2004
Springer
15 years 12 months ago
2004
Springer
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
146
click to vote
MASCOTS
2003
15 years 7 months ago
2003
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
181
click to vote
JCM
2007
15 years 6 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
194
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
166
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
We describe a system for aggregating heterogeneous resources from distinct administrative domains into an enterprise-wide compute grid, such that the aggregated resource provides ...