146 search results - page 4 / 30 » A new metric for robustness with application to job scheduli... |
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
13 years 10 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
RTSS
2002
IEEE
13 years 11 months ago
2002
IEEE
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how...
JSSPP
2004
Springer
13 years 11 months ago
2004
Springer
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
RTSS
2003
IEEE
13 years 11 months ago
2003
IEEE
—Many real-time systems have firm real-time requirements which allow occasional deadline violations but discard any jobs that are not finished by their deadlines. To measure the ...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...