357 search results - page 28 / 72 » Scheduling optional computations in fault-tolerant real-time... |
103
Voted
IPPS
1999
IEEE
15 years 4 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...
76
Voted
RTSS
2009
IEEE
15 years 7 months ago
2009
IEEE
An empirical study of implementation tradeoffs (choice of ready queue implementation, quantum-driven vs. eventdriven scheduling, and interrupt handling strategy) affecting global ...
ECRTS
2003
IEEE
15 years 5 months ago
2003
IEEE
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
109
Voted
RTSS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
ICPP
2007
IEEE
15 years 6 months ago
2007
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is b...