4081 search results - page 266 / 817 » Scheduling in polling systems |
185
click to vote
SIGMETRICS
2010
ACM
15 years 10 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
165
click to vote
PUK
2000
15 years 8 months ago
2000
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
177
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
183
click to vote
EUROMICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
167
click to vote
IPPS
1999
IEEE
15 years 11 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...