9 search results - page 2 / 2 » Scheduling Imprecise Computations with Wind-up Parts |
ECRTS
2000
IEEE
13 years 12 months ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
HPCA
1996
IEEE
13 years 11 months ago
1996
IEEE
We have investigated the register file requirements of dynamically scheduled processors using register renaming and dispatch queues running the SPEC92 benchmarks. We looked at pro...
LCTRTS
2010
Springer
13 years 9 months ago
2010
Springer
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...