357 search results - page 28 / 72 » Scheduling optional computations in fault-tolerant real-time... |
154
click to vote
IPPS
1999
IEEE
15 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...
157
click to vote
RTSS
2009
IEEE
16 years 24 days 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 ...
149
click to vote
ECRTS
2003
IEEE
15 years 11 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...
162
click to vote
RTSS
2006
IEEE
16 years 2 days 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...
151
click to vote
ICPP
2007
IEEE
16 years 11 days 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...