614 search results - page 14 / 123 » Resource Minimization Job Scheduling |
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
106
click to vote
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
INFORMATICALT
2006
14 years 11 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
130
click to vote
SIGMETRICS
2002
ACM
14 years 11 months ago
2002
ACM
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
COR
2008
14 years 11 months ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...